Quantum algorithmic measurement
Authors:
Open Access
- 16 February 2022
- journal article
- research article
- Published by Springer Nature in Nature Communications
- Vol. 13 (1) , 1-9
Abstract
There has been recent promising experimental and theoretical evidence that quantum computational tools might enhance the precision and efficiency of physical experiments. However, a systematic treatment and comprehensive framework are missing. Here we initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms and interactive protocols. We use the QUALM framework to study two important experimental problems in quantum many-body physics: determining whether a system’s Hamiltonian is time-independent or time-dependent, and determining the symmetry class of the dynamics of the system. We study abstractions of these problems and show for both cases that if the experimentalist can use her experimental samples coherently (in both space and time), a provable exponential speedup is achieved compared to the standard situation in which each experimental sample is accessed separately. Our work suggests that quantum computers can provide a new type of exponential advantage: exponential savings in resources in quantum experiments.Keywords
All Related Versions
Funding Information
- Hertz Foundation
This publication has 38 references indexed in Scilit:
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimatorsNew Journal of Physics, 2012
- Quantum State Tomography via Compressed SensingPhysical Review Letters, 2010
- Adaptive versus nonadaptive strategies for quantum channel discriminationPhysical Review A, 2010
- Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup ProblemAlgorithmica, 2008
- Quantum Circuit ArchitecturePhysical Review Letters, 2008
- Black holes as mirrors: quantum information in random subsystemsJournal of High Energy Physics, 2007
- Quantum lithography, entanglement and Heisenberg-limited parameter estimationJournal of Optics B: Quantum and Semiclassical Optics, 2004
- The quantum query complexity of the hidden subgroup problem is polynomialInformation Processing Letters, 2004
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- On the Power of Quantum ComputationSIAM Journal on Computing, 1997