It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Quantum memory—the capacity to faithfully preserve quantum coherence and correlations—is essential for quantum-enhanced technology. There is thus a pressing need for operationally meaningful means to benchmark candidate memories across diverse physical platforms. Here we introduce a universal benchmark distinguished by its relevance across multiple key operational settings, exactly quantifying (1) the memory’s robustness to noise, (2) the number of noiseless qubits needed for its synthesis, (3) its potential to speed up statistical sampling tasks, and (4) performance advantage in non-local games beyond classical limits. The measure is analytically computable for low-dimensional systems and can be efficiently bounded in the experiment without tomography. We thus illustrate quantum memory as a meaningful resource, with our benchmark reflecting both its cost of creation and what it can accomplish. We demonstrate the benchmark on the five-qubit IBM Q hardware, and apply it to witness the efficacy of error-suppression techniques and quantify non-Markovian noise. We thus present an experimentally accessible, practically meaningful, and universally relevant quantifier of a memory’s capability to preserve quantum advantage.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details





1 Peking University, Center on Frontiers of Computing Studies, Department of Computer Science, Beijing, China (GRID:grid.11135.37) (ISNI:0000 0001 2256 9319); Stanford University, Stanford Institute for Theoretical Physics, Stanford, USA (GRID:grid.168010.e) (ISNI:0000000419368956); University of Oxford, Department of Materials, Oxford, UK (GRID:grid.4991.5) (ISNI:0000 0004 1936 8948)
2 University of California, Department of Electrical Engineering and Computer Sciences, Berkeley, USA (GRID:grid.47840.3f) (ISNI:0000 0001 2181 7878); Tsinghua University, Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Beijing, China (GRID:grid.12527.33) (ISNI:0000 0001 0662 3178)
3 Tsinghua University, Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Beijing, China (GRID:grid.12527.33) (ISNI:0000 0001 0662 3178)
4 Nanyang Technological University, Nanyang Quantum Hub, School of Physical and Mathematical Sciences, Singapore, Singapore (GRID:grid.59025.3b) (ISNI:0000 0001 2224 0361)
5 National University of Singapore, Centre for Quantum Technologies, Singapore, Singapore (GRID:grid.4280.e) (ISNI:0000 0001 2180 6431)
6 Nanyang Technological University, Nanyang Quantum Hub, School of Physical and Mathematical Sciences, Singapore, Singapore (GRID:grid.59025.3b) (ISNI:0000 0001 2224 0361); National University of Singapore, Centre for Quantum Technologies, Singapore, Singapore (GRID:grid.4280.e) (ISNI:0000 0001 2180 6431); Nanyang Technological University, Complexity Institute, Singapore, Singapore (GRID:grid.59025.3b) (ISNI:0000 0001 2224 0361)