DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Efficient verification of anticoncentrated quantum states

Journal Article · · npj Quantum Information

I present a method for estimating the fidelity F(μ, τ) between a preparable quantum state μ and a classically specified pure target state τ=|τ> <τ|, using simple quantum circuits and on-the-fly classical calculation (or lookup) of selected amplitudes of |τ>. The method is sample efficient for anticoncentrated states (including many states that are hard to simulate classically), with approximate cost 4ϵ–2(1 – F)dpcoll where ϵ is the desired precision of the estimate, d is the dimension of the Hilbert space, and pcoll is the collision probability of the target distribution. Furthermore, this scaling is exponentially better than that of any method based on classical sampling. I also present a more sophisticated version of the method that uses any efficiently preparable and well-characterized quantum state as an importance sampler to further reduce the number of copies of μ needed. Though some challenges remain, this work takes a significant step toward scalable verification of complex states produced by quantum processors.

Research Organization:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Sponsoring Organization:
USDOE
Grant/Contract Number:
AC05-00OR22725
OSTI ID:
1817559
Journal Information:
npj Quantum Information, Journal Name: npj Quantum Information Journal Issue: 1 Vol. 7; ISSN 2056-6387
Publisher:
Nature Partner JournalsCopyright Statement
Country of Publication:
United States
Language:
English

References (21)

Quantum Computers as Universal Quantum Simulators: State‐of‐the‐Art and Perspectives journal December 2019
Quantum machine learning journal September 2017
Characterizing quantum supremacy in near-term devices journal April 2018
Predicting many properties of a quantum system from very few measurements journal June 2020
Quantum supremacy using a programmable superconducting processor journal October 2019
Temporally unstructured quantum computation journal February 2009
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
  • Bremner, Michael J.; Jozsa, Richard; Shepherd, Dan J.
  • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 467, Issue 2126 https://doi.org/10.1098/rspa.2010.0301
journal July 2010
Validating quantum computers using randomized model circuits journal September 2019
Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate journal April 1996
Distance measures to compare real and ideal quantum processes journal June 2005
Efficient Measurement of Quantum Dynamics via Compressive Sensing journal March 2011
Direct Fidelity Estimation from Few Pauli Measurements journal June 2011
Practical Characterization of Quantum Devices without Tomography journal November 2011
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations journal August 2016
Learning a Local Hamiltonian from Local Measurements journal January 2019
Adaptive Compressive Tomography with No a priori Information journal March 2019
Sample Complexity of Device-Independently Certified “Quantum Supremacy” journal May 2019
Quantum Fingerprinting journal September 2001
Quantum simulation journal March 2014
High-quality quantum-imaging algorithm and experiment based on compressive sensing journal January 2010
On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking journal November 2020