Editing Quantum Volume Estimation

Jump to navigation Jump to search
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.

Latest revision Your text
Line 27: Line 27:
* The data of achievable depth is gathered by sweeping over values of width <math>m</math> and depth <math>d</math> of the model circuit.
* The data of achievable depth is gathered by sweeping over values of width <math>m</math> and depth <math>d</math> of the model circuit.
* Using all the data gathered, the quantum volume is computed. The quantum volume treats the width and depth of a model circuit with equal importance and measures the largest square shaped (i.e., <math>m = d</math>) model circuit a quantum computer can implement successfully on average.
* Using all the data gathered, the quantum volume is computed. The quantum volume treats the width and depth of a model circuit with equal importance and measures the largest square shaped (i.e., <math>m = d</math>) model circuit a quantum computer can implement successfully on average.
==Notation==
* <math>U</math>: Model circuit
* <math>U'</math>: Implementation of the model circuit by the quantum transpiler
* <math>m</math>: width of the model circuit
* <math>d</math>: depth of the model circuit
* <math>F_{avg}(U, U')</math>: Average fidelity between <math>U</math> and <math>U'</math>
* <math>\epsilon</math>: approximation error
* <math>d(m)</math>: Achievable depth, which is the largest <math>d</math> such that we are confident that the probability of observing a heavy output is greater than <math>2/3</math>
* <math>V_Q</math>: Quantum Volume
* <math>H_U</math>: Set of heavy outputs for a model circuit <math>U</math>
* <math>x</math>: Outcome of executing <math>U'</math>, which is a observable bit string, <math>x \in \{0,1\}^m</math>
* <math>p_U(x)</math>: Ideal output distribution for <math>U</math>. <math>p_U(x) = |\langle x|U|0\rangle|^2</math>
* <math>p_{med}</math>: median of the set of probabilities
* <math>n_c</math>: Number of repetitions, <math>n_c>100</math>
* <math>n_s</math>: Number of repetitions
==Hardware Requirements==
* Quantum Computing device with a gate set
* Measurement device
==Properties==
* '''Figure of merit''': Quantum Volume
* Quantum computing systems with high-fidelity operations, high connectivity, large calibrated gate sets, and circuit rewriting tool chains are expected to have higher quantum volumes
* The protocol can be implemented with any universal programmable quantum computing device. Quantum volume is architecture-independent, and can be applied to any system that is capable of running quantum circuits.
* The method used to compute the heavy outputs from the ideal output distribution of the model circuit scales exponentially with the width <math>m</math>.
* Ideally, the probability of observing a heavy output would be estimated using all of the qubits of a large device, but NISQ devices have appreciable error rates, so we begin with small model circuits and progress to larger ones.
* The quantum volume treats the width and depth of a model circuit with equal importance and measures the largest square shaped (i.e., <math>m = d</math>) model circuit a quantum computer can implement successfully on average.
* Given a model circuit <math>U</math>, a circuit-to-circuit transpiler finds an implementation <math>U'</math> for the target system such that <math>1- F_{avg}(U, U') \leq \epsilon \ll 1</math>
* There are two possible paths for increasing the quantum volume, which is given by the numerical simulations for given connectivity. The first path is to prioritize improving the gate fidelity above other operations. This
sets the roadmap for device performance to focus on the errors that limit gate performance, such as coherence and
calibration errors. The second path stems from the observation that, for these devices and this metric, circuit
optimization is becoming important.
==Protocol Description==
'''Function''': ComputeHeavyOutputs<math>(U, m)</math>
'''Input''': <math>U, m</math>
'''Output''': <math>H_U</math>
* Obtain <math>p_U(x)</math> for <math>x \in \{0,1\}^m</math>
* Sort in ascending order <math>p_0 \leq p_1 ... \leq p_{2^m -1}</math>
* <math>p_{med}  = (p_{2^{m-1}} + p_{2^{m-1}-1})/2 </math>
* <math>H_U = \{x\in \{0,1\}^m</math> such that <math>p_U(x) > p_{med}\}</math>
'''Function''': ComputeQuantumVolume
'''Output''': Figure of merit: Quantum Volume, <math>V_Q</math>
* For <math>i = 1, 2, ..., m</math>:
** For <math>j = 1, 2, ..., d</math>:
*** <math>d(m) = 0</math>
*** <math>n_h = 0</math>
*** For <math>k = 1, 2, ..., n_c</math>:
**** Pick random model circuit <math>U</math>
**** <math>H_U =</math> ComputeHeavyOutputs<math>(U, m)</math>
**** Compile <math>U'</math>
**** For <math>l = 1, 2, ..., n_s</math>:
***** Get output <math>x</math>
***** If <math>x\in H_U</math> then <math>n_h = n_h + 1</math>
*** If <math>\frac{n_h-2\sqrt{n_h(n_s-n_h/n_c)}}{n_c n_S} > \frac{2}{3}</math>
**** <math>d(m) = </math>max<math>(d(m), d)</math>
**** Store data <math>(m, d(m))</math>
* Calculate <math>V_Q</math> from stored data, where log<math>_2 V_Q</math> = argmax<math>_m</math> min<math>(m, d(m))</math>
==Further Information==
== Related Papers ==
* Andrew W. Cross et al (2011) arXiv:1811.12926v3: Validating quantum computers using randomized model circuits
<div style='text-align: right;'>''*contributed by Rhea Parekh''</div>
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Quantum Protocol Zoo:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel Editing help (opens in new window)