• Corpus ID: 248218485

Establishing trust in quantum computations

@inproceedings{Proctor2022EstablishingTI,
  title={Establishing trust in quantum computations},
  author={Timothy J. Proctor and Stefan Seritan and Erik Nielsen and Kenneth M Rudinger and Kevin Young and Robin Blume-Kohout and Mohan Sarovar},
  year={2022}
}
Real-world quantum computers have grown su ffi ciently complex that they can no longer be simulated by classical supercomputers, but their computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it is no longer always feasible to use classical simulations to directly check the correct-ness of quantum computations. Without practical methods for quantifying the accuracy with which a quantum algorithm has been executed, it is di ffi cult to establish… 

Figures from this paper

Demonstrating scalable randomized benchmarking of universal gate sets

Jordan Hines,1, 2, ∗ Marie Lu,3 Ravi K. Naik,3, 4 Akel Hashim,3, 4 Jean-Loup Ville,3, † Brad Mitchell,3, 4 John Mark Kriekebaum,3, 5, ‡ David I. Santiago,3, 4 Stefan Seritan,2 Erik Nielsen,2 Robin

References

SHOWING 1-10 OF 44 REFERENCES

A Taxonomy of Small Markovian Errors

It is shown how to transform a gate’s process matrix into an error generator that represents the same information more usefully, and how to build a large variety of reduced models for gate errors by combining elementary error generators and or entire subsectors of generator space.

A Quantum Approximate Optimization Algorithm

A quantum algorithm that produces approximate solutions for combinatorial optimization problems that depends on a positive integer p and the quality of the approximation improves as p is increased, and is studied as applied to MaxCut on regular graphs.

Scalable randomized benchmarking of quantum computers using mirror circuits

This work shows how to use a simple and customizable class of circuits-randomized mirror circuits-to perform scalable, robust, and flexible randomized benchmarking of Clifford gates, and shows that this technique approximately estimates the infidelity of an average many-qubit logic layer.

Measuring the capabilities of quantum computers

It is found that standard error metrics are poor predictors of whether a program will run successfully on today’s hardware, and that current processors vary widely in their sensitivity to program structure.

Gate Set Tomography

The foundations of GST are presented in comprehensive detail, covering the intellectual history, techniques and experiments used to achieve its intended purpose, data analysis, gauge freedom and fixing, error bars, and the interpretation of gauge-fixed estimates of gate sets.

Magic hinders quantum certification

The resource theory of magic quantifies the hardness of quantum certification protocols, showing that the resources needed to certify the quality of the application of a given unitary U are governed by the magic in the Choi state associated with U, which is shown to possess a profound connection with out-of-time order correlators.

Simulating challenging correlated molecules and materials on the Sycamore quantum processor

This work simulates static and dynamical electronic structure on a superconducting quantum processor derived from Google’s Sycamore architecture for two representative correlated electron problems: the nitrogenase iron-sulfur molecular clusters, and α -ruthenium trichloride, a proximate spin-liquid material.

Towards experimental classical verification of quantum computation

Roman Stricker,1 Jose Carrasco,2 Martin Ringbauer,1 Lukas Postler,1 Michael Meth,1 Claire Edmunds,1 Philipp Schindler,1 Rainer Blatt,1, 3 Peter Zoller,2, 3 Barbara Kraus,2 and Thomas Monz1, 4

Interactive Protocols for Classically-Verifiable Quantum Advantage

Joint Quantum Institute, Departments of Physics and Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA Joint Center for Quantum Information and Computer Science,