Benchmarking quantum processors with a single qubit

@article{Gkta2019BenchmarkingQP,
  title={Benchmarking quantum processors with a single qubit},
  author={Oktay G{\"o}ktaş and Weng Kian Tham and Kent Bonsma-Fisher and Aharon Brodutch},
  journal={Quantum Information Processing},
  year={2019},
  volume={19},
  pages={1-17}
}
The first generation of small noisy quantum processors have recently become available to non-specialists who are not required to understand specifics of the physical platforms and, in particular, the types and sources of noise. As such, it is useful to benchmark the performance of such computers against specific tasks that may be of interest to users, ideally keeping both the circuit depth and width as free parameters. Here, we benchmark the IBM quantum experience using the deterministic… 
View on Springer
arxiv.org
1 Citations

One Citation

Experimental investigation of quantum discord in DQC1

Quantum discord has been proposed as a resource responsible for the exponential speedup in deterministic quantum computation with one pure qubit (DQC1). Investigation of the quantum discord generated…

References

SHOWING 1-10 OF 40 REFERENCES

On the hardness of classically simulating the one clean qubit model

This Letter introduces a slightly modified version of DQC1, which it is shown that DZC1(k) cannot be classically efficiently simulated for any k≥3 unless the polynomial hierarchy collapses at the third level.

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of…

Quantum supremacy using a programmable superconducting processor

Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Direct Randomized Benchmarking for Multiqubit Devices.

This Letter proposes a direct RB protocol that uses random circuits over the native gates in a device, which are seeded by an initial layer of Clifford-like randomization, and it can be extended to processors with more qubits and it reports a more directly informative and flexible error rate than the one reported by Clifford RB.

Randomized Benchmarking of Quantum Gates

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate…

A generative modeling approach for benchmarking and training shallow quantum circuits

A quantum circuit learning algorithm that can be used to assist the characterization of quantum devices and to train shallow circuits for generative tasks is proposed and it is demonstrated that this approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states.

Enhancing quantum control by bootstrapping a quantum processor of 12 qubits

The results show that even at the 12-qubit level, a quantum processor can be a useful lab instrument, and propose a method for combining the MQFC technique with a twirling protocol, to optimize the control sequence that produces a desired Clifford gate.

Experimental estimation of average fidelity of a Clifford gate on a 7-qubit quantum processor.

A unitary 2-design and twirling protocol is used for efficiently estimating the average fidelity of Clifford gates, to certify a 7-qubit entangling gate in a nuclear magnetic resonance quantum processor and to satisfy a statistical confidence level of 99%.

Complete 3-Qubit Grover search on a programmable quantum computer

The authors perform the Grover quantum search algorithm on 3 qubits using trapped ions, demonstrating two methods for marking the correct result in the algorithm’s oracle and providing data for searches yielding 1 or 2 solutions.

Noise-tolerant parity learning with one quantum bit

This work presents a new quantum parity learning algorithm with which the quantum advantage is retained as long as one qubit in the system has non-zero polarization.