---
title: ProbDistribution (latest version)
description: API reference for qiskit.result.ProbDistribution in the latest version of qiskit
source: https://eu-de.quantum.cloud.ibm.com/docs/en/api/qiskit/qiskit.result.ProbDistribution
---

# ProbDistribution

*class* `qiskit.result.ProbDistribution(data, shots=None)`

[GitHub](https://github.com/Qiskit/qiskit/tree/stable/2.5/qiskit/result/distributions/probability.py#L23-L100)

Bases: [`dict`](https://docs.python.org/3/library/stdtypes.html#dict)

A generic dict-like class for probability distributions.

Builds a probability distribution object.

**Parameters**

- **data** ([*dict*](https://docs.python.org/3/library/stdtypes.html#dict)) –

  Input probability data. Where the keys represent a measured classical value and the value is a float for the probability of that result. The keys can be one of several formats:

  > - A hexadecimal string of the form `"0x4a"`
  > - A bit string e.g. `'0b1011'` or `"01011"`
  > - An integer

- **shots** ([*int*](https://docs.python.org/3/library/functions.html#int)) – Number of shots the distribution was derived from.

**Raises**

- [**TypeError**](https://docs.python.org/3/library/exceptions.html#TypeError) – If the input keys are not a string or int
- [**ValueError**](https://docs.python.org/3/library/exceptions.html#ValueError) – If the string format of the keys is incorrect

## Methods

### binary\_probabilities

`binary_probabilities(num_bits=None)`

[GitHub](https://github.com/Qiskit/qiskit/tree/stable/2.5/qiskit/result/distributions/probability.py#L75-L91)

Build a probabilities dictionary with binary string keys

**Parameters**

**num\_bits** ([*int*](https://docs.python.org/3/library/functions.html#int)) – number of bits in the binary bitstrings (leading zeros will be padded). If None, a default value will be used. If keys are given as integers or strings with binary or hex prefix, the default value will be derived from the largest key present. If keys are given as bitstrings without prefix, the default value will be derived from the largest key length.

**Returns**

**A dictionary where the keys are binary strings in the format**

`"0110"`

**Return type**

[dict](https://docs.python.org/3/library/stdtypes.html#dict)

### clear

`clear()`

Remove all items from the dict.

### copy

`copy()`

Return a shallow copy of the dict.

### fromkeys

*classmethod* `fromkeys(iterable, value=None, /)`

Create a new dictionary with keys from iterable and values set to value.

### get

`get(key, default=None, /)`

Return the value for key if key is in the dictionary, else default.

### hex\_probabilities

`hex_probabilities()`

[GitHub](https://github.com/Qiskit/qiskit/tree/stable/2.5/qiskit/result/distributions/probability.py#L93-L100)

Build a probabilities dictionary with hexadecimal string keys

**Returns**

**A dictionary where the keys are hexadecimal strings in the**

format `"0x1a"`

**Return type**

[dict](https://docs.python.org/3/library/stdtypes.html#dict)

### items

`items()`

Return a set-like object providing a view on the dict’s items.

### keys

`keys()`

Return a set-like object providing a view on the dict’s keys.

### pop

`pop(k[, d]) → v, remove specified key and return the corresponding value.`

If the key is not found, return the default if given; otherwise, raise a KeyError.

### popitem

`popitem()`

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

### setdefault

`setdefault(key, default=None, /)`

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

### update

`update([E, ]**F) → None.  Update D from mapping/iterable E and F.`

If E is present and has a .keys() method, then does: for k in E.keys(): D\[k] = E\[k] If E is present and lacks a .keys() method, then does: for k, v in E: D\[k] = v In either case, this is followed by: for k in F: D\[k] = F\[k]

### values

`values()`

Return an object providing a view on the dict’s values.
