Editing Quantum Volume Estimation
Jump to navigation
Jump to search
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 54: | Line 54: | ||
* '''Figure of merit''': Quantum Volume | * '''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 | * 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 | * The protocol can be implemented with any universal programmable quantum computing device | ||
* 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>. | * 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. | * 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. | * 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> | * 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> | ||
==Protocol Description== | ==Protocol Description== |