<p>Given the superposed output of some quantum computation, suppose I want to know the mean state, i.e. the mean probability of each qubit sampled over all states.</p>

<p>The most obvious way to get this is repeated sampling. Obviously the more samples I take, the more accurately I will be able to estimate the mean. </p>

<p>Can this performance be improved upon? For example, if we take a Quantum Fourier Transform then the probability of state |0> is presumably the mean quantity we're after. Of course we can't guarantee measuring it, can we use something like Grover's algorithm to make its measurement extremely likely in $\sqrt{n}$ steps? And if we do, does that give better performance than the repeated sampling approach?</p>

CC BY-SA 3.0
2017-08-22T03:06:58.223Z
Do you want the expectation *per-qubit*, or do you want the weighted average over some whole register of qubits with each possible reading interpreted as a twos-complement binary unsigned integer?
Craig Gidney
CC BY-SA 3.0
2017-08-22T10:07:56.887Z
Expectation per qubit would be fine. Twos complement is an interesting addition but not what I had in mind.
Sideshow Bob
CC BY-SA 3.0
2017-08-22T13:25:13.657Z
Also to define this problem better - I only need to know the mean state of *some* qubits - the computation is allowed to contain other qubits whose final state I don't care about
Sideshow Bob
CC BY-SA 3.0
2018-04-04T00:37:50.887Z
You can ask this question at: https://quantumcomputing.stackexchange.com/ .
Rob
<quantum-computing>
Is there a way to extract the mean from a quantum superposition?
Sideshow Bob
# Is there a way to extract the mean from a quantum superposition?

(Asked by: username_0 on 2017-08-21)

Given the superposed output of some quantum computation, suppose I want to know the mean state, i.e. the mean probability of each qubit sampled over all states.

The most obvious way to get this is repeated sampling. Obviously the more samples I take, the more accurately I will be able to estimate the mean.

Can this performance be improved upon? For example, if we take a Quantum Fourier Transform then the probability of state |0> is presumably the mean quantity we're after. Of course we can't guarantee measuring it, can we use something like Grover's algorithm to make its measurement extremely likely in $\sqrt{n}$ steps? And if we do, does that give better performance than the repeated sampling approach?

**Tags:** quantum-computing

> **Comments:**
> **username_1**: Do you want the expectation *per-qubit*, or do you want the weighted average over some whole register of qubits with each possible reading interpreted as a twos-complement binary unsigned integer?  
> **username_0**: Expectation per qubit would be fine. Twos complement is an interesting addition but not what I had in mind.  
> **username_0**: Also to define this problem better - I only need to know the mean state of *some* qubits - the computation is allowed to contain other qubits whose final state I don't care about  
> **username_2**: You can ask this question at: https://quantumcomputing.stackexchange.com/ .  

---

## 0 answers

