Information scrambling in quantum circuits
Open accessThe DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
Abstract
Quantum scrambling: Information spreading in interacting quantum systems is of relevance to a wide range of settings, from black holes to strange metals. Mi et al . used the Sycamore quantum processor to study this process. Through judicial design of quantum circuits, the researchers were able to separate the contributions of operator spreading and operator entanglement. Measuring the mean value and fluctuations of a specific correlator enabled quantifying these distinct contributions. —JS
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“the N initial stabilizers of the state can simply be tracked as they propagate through the circuit (so-called operator spreading94) and thereby simulation of the circuit can be easily accomplished.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [94]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“This causes not only operator spreading but also so-called operator entanglement94.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [94]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Self-citationChaos and quantum thermalization
Srednicki, M. (1994) · Physical Review E · doi:10.1103/physreve.50.888 · Cited by 3,175
Thermalization and its mechanism for generic isolated quantum systems
Rigol, M., Dunjko, V., & Olshanii, M. (2008) · Nature · doi:10.1038/nature06838 · Cited by 3,065
The critical properties of the two-dimensional xy model
Kosterlitz, J. M. (1974) · Journal of Physics C: Solid State Physics · doi:10.1088/0022-3719/7/6/005 · Cited by 2,880
Quantum statistical mechanics in a closed system
Deutsch, J. M. (1991) · Physical Review A · doi:10.1103/physreva.43.2046 · Cited by 2,860
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2011) · Cited by 2,724
Many-Body Localization and Thermalization in Quantum Statistical Mechanics
Nandkishore, R., & Huse, D. A. (2015) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031214-014726 · Cited by 2,376
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Self-citationBasko, D. M., Aleiner, I. L., & Altshuler, B. L. (2006) · Annals of Physics · doi:10.1016/j.aop.2005.11.014 · Cited by 2,015 · cited 2×
“Examples include Clifford circuits [45], dynamics of free fermions [46] and many-body localization [11].”
BackgroundMethodSelf-citationEfficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779
Black holes and the butterfly effect
Shenker, S. H., & Stanford, D. (2014) · Journal of High Energy Physics · doi:10.1007/jhep03(2014)067 · Cited by 1,533
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“Indeed, it is well known that circuits composed of Clifford gates only can be simulated in polynomial time [37], with a numerical cost which grows exponentially with the number of non-Clifford gates [63].”
BackgroundBlack holes as mirrors: quantum information in random subsystems
Hayden, P., & Preskill, J. (2007) · Journal of High Energy Physics · doi:10.1088/1126-6708/2007/09/120 · Cited by 1,332
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227 · cited 1×
“Examples include Clifford circuits [45], dynamics of free fermions [46] and many-body localization [11].”
BackgroundCharacterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175 · cited 9×
“The Pauli errors of the calibrated iSWAP and √ iSWAP gates are measured through XEB [38, 54], which uses a collection of random circuits comprising interleaved two-qubit and random single-qubit gates.”
MethodInfluentialSelf-citationSekino, Y., & Susskind, L. (2008) · Journal of High Energy Physics · doi:10.1088/1126-6708/2008/10/065 · Cited by 1,112
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019 · cited 1×
“After measuring a sufficient number of circuit instances at different circuit depths, it has been shown that XEB reliably yields gate errors that are very consistent with values obtained from conventional characterization methods such as randomized benchmarking [13, 38, 51].”
MethodBasko, D. M., Aleǐner, I. L., & Altshuler, B. L. (2006) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 970
Phase Structure of Driven Quantum Systems
Khemani, V., Lazarides, A., Moessner, R., & Sondhi, S. L. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.250401 · Cited by 902
Critical behavior of random transverse-field Ising spin chains
Fisher, D. S. (1995) · Physical Review B · doi:10.1103/physrevb.51.6411 · Cited by 826
Operator Spreading in Random Unitary Circuits
Nahum, A., Vijay, S., & Haah, J. (2018) · Physical Review X · doi:10.1103/physrevx.8.021014 · Cited by 738
Simulating Physics with Computers
Feynman, R. P. (2018) · Feynman and Computation · doi:10.1201/9780429500459-11 · Cited by 731
Hosur, P., Qi, X.-L., Roberts, D. A., & Yoshida, B. (2016) · Journal of High Energy Physics · doi:10.1007/jhep02(2016)004 · Cited by 717
Roberts, D. A., Stanford, D., & Susskind, L. (2015) · Journal of High Energy Physics · doi:10.1007/jhep03(2015)051 · Cited by 652
Decoherence in a superconducting quantum bit circuit
Ithier, G., Collin, E., Joyez, P., Meeson, P. J., Vion, D., Esteve, D., Chiarello, F., Shnirman, A., Makhlin, Y., Schriefl, J., et al. (2005) · Physical Review B · doi:10.1103/physrevb.72.134519 · Cited by 639 · cited 1×
“The Gaussian shape of the decay at earlier times suggests that low-frequency noise is likely the dominant source of decoherence [55].”
BackgroundGärttner, M., Bohnet, J. G., Safavi-Naini, A., Wall, M. L., Bollinger, J. J., & Rey, A. M. (2017) · Nature Physics · doi:10.1038/nphys4119 · Cited by 613
Operator Hydrodynamics, OTOCs, and Entanglement Growth in Systems without Conservation Laws
von Keyserlingk, C. W., Rakovszky, T., Pollmann, F., & Sondhi, S. L. (2018) · Physical Review X · doi:10.1103/physrevx.8.021013 · Cited by 585 · cited 1×
“Such connection was identified for Hamiltonian dynamics [11] and subsequently for simplified models of random circuits [18, 19] where uniformly random two-qubit gate was assumed.”
MethodEntanglement in the quantum HeisenbergXYmodel
Wang, X. (2001) · Physical Review A · doi:10.1103/physreva.64.012313 · Cited by 576 · cited 1×
“S3 in fact are the digitized realizations of the so-called XY model [47] which is of wide interest in condensed-matter physics due to its ability to capture a variety of interesting physical phenomena”
BackgroundEfficient Z gates for quantum computing
McKay, D. C., Wood, C. J., Sheldon, S., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review A · doi:10.1103/physreva.96.022330 · Cited by 557 · cited 1×
“This process effectively reduces the number of Z-rotations in the circuits by a factor of 2 and has been demonstrated to incur negligible degradation in the overall fidelity, since the only physical changes are modifications to the phases of the microwave drives of single-qubit gates [53].”
BackgroundKhemani, V., Vishwanath, A., & Huse, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031057 · Cited by 498
Measuring the scrambling of quantum information
Swingle, B., Bentsen, G., Schleier-Smith, M., & Hayden, P. (2016) · Physical Review A · doi:10.1103/physreva.94.040302 · Cited by 492
The Heisenberg Representation of Quantum Computers
Gottesman, D. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9807006 · Cited by 489 · cited 1×
“Indeed, it is well known that circuits composed of Clifford gates only can be simulated in polynomial time [37], with a numerical cost which grows exponentially with the number of non-Clifford gates [63].”
BackgroundSimulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Chaos and complexity by design
Roberts, D. A., & Yoshida, B. (2017) · Journal of High Energy Physics · doi:10.1007/jhep04(2017)121 · Cited by 455
Fast Accurate State Measurement with Superconducting Qubits
Jeffrey, E., Sank, D., Mutus, J. Y., White, T. C., Kelly, J., Barends, R., Chen, Y., Chen, Z., Chiaro, B., Dunsworth, A., et al. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.190504 · Cited by 449
Self-citationTowards the fast scrambling conjecture
Lashkari, N., Stanford, D., Hastings, M., Osborne, T., & Hayden, P. (2013) · Journal of High Energy Physics · doi:10.1007/jhep04(2013)022 · Cited by 428
Quasiclassical Method in the Theory of Superconductivity
Larkin, A. I., & Ovchinnikov, Y. N. (1969) · Journal of Experimental and Theoretical Physics · Cited by 426
Measuring Out-of-Time-Order Correlators on a Nuclear Magnetic Resonance Quantum Simulator
Li, J., Fan, R., Wang, H., Ye, B., Zeng, B., Zhai, H., Peng, X., & Du, J. (2017) · Physical Review X · doi:10.1103/physrevx.7.031011 · Cited by 403
Verified quantum information scrambling
Landsman, K. A., Figgatt, C., Schuster, T., Linke, N. M., Yoshida, B., Yao, N. Y., & Monroe, C. (2019) · Nature · doi:10.1038/s41586-019-0952-6 · Cited by 368
Introduction to ‘Quantum Integrability in Out of Equilibrium Systems’
Calabrese, P., Essler, F. H. L., & Mussardo, G. (2016) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2016/06/064001 · Cited by 361 · cited 1×
“In the main text of this work, we have primarily focused on quantum circuits that are non-integrable [44], i.”
BackgroundClassical simulation of noninteracting-fermion quantum circuits
Terhal, B. M., & DiVincenzo, D. P. (2002) · Physical Review A · doi:10.1103/physreva.65.032325 · Cited by 329
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
Bravyi, S., & Gosset, D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.250501 · Cited by 320 · cited 1×
“Similarly, it is possible to sample approximate amplitudes by only selecting the dominant stabilizer states in the Clifford expansion [64, 65].”
BackgroundDiffusive Hydrodynamics of Out-of-Time-Ordered Correlators with Charge Conservation
Rakovszky, T., Pollmann, F., & von Keyserlingk, C. W. (2018) · Physical Review X · doi:10.1103/physrevx.8.031058 · Cited by 317
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Valiant, L. G. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700377025 · Cited by 311
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302 · cited 1×
“Similarly, it is possible to sample approximate amplitudes by only selecting the dominant stabilizer states in the Clifford expansion [64, 65].”
BackgroundEntanglement of quantum evolutions
Zanardi, P. (2001) · Physical Review A · doi:10.1103/physreva.63.040304 · Cited by 295
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Z., Satzinger, K., Barends, R., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.120504 · Cited by 293 · cited 3×
“After measuring a sufficient number of circuit instances at different circuit depths, it has been shown that XEB reliably yields gate errors that are very consistent with values obtained from conventional characterization methods such as randomized benchmarking [13, 38, 51].”
MethodResultSelf-citationExact Correlation Functions for Dual-Unitary Lattice Models in 1 + 1 Dimensions
Bertini, B., Kos, P., & Prosen, T. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.210601 · Cited by 278
Quantum Information Scrambling on a Superconducting Qutrit Processor
Blok, M. S., Ramasesh, V. V., Schuster, T., O’Brien, K., Kreikebaum, J. M., Dahlen, D., Morvan, A., Yoshida, B., Yao, N. Y., & Siddiqi, I. (2021) · Physical Review X · doi:10.1103/physrevx.11.021010 · Cited by 262
Aleiner, I. L., Faoro, L., & Ioffe, L. B. (2016) · Annals of Physics · doi:10.1016/j.aop.2016.09.006 · Cited by 224
Self-citationSimulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S. B., Browne, D. E., Calpin, P., Campbell, E. T., Gosset, D., & Howard, M. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 224
Establishing the quantum supremacy frontier with a 281 Pflop/s simulation
Villalonga, B., Lyakh, D. I., Boixo, S., Neven, H., Humble, T. S., Biswas, R., Rieffel, E. G., Ho, A., & Mandrà, S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7eeb · Cited by 200
Self-citationPhase structure of one-dimensional interacting Floquet systems. II. Symmetry-broken phases
von Keyserlingk, C. W., & Sondhi, S. L. (2016) · Physical Review B · doi:10.1103/physrevb.93.245146 · Cited by 197
Disentangling Scrambling and Decoherence via Quantum Teleportation
Yoshida, B., & Yao, N. Y. (2019) · Physical Review X · doi:10.1103/physrevx.9.011006 · Cited by 187
Hyper-optimized tensor network contraction
Gray, J., & Kourtis, S. (2021) · Quantum · doi:10.22331/q-2021-03-15-410 · Cited by 186 · cited 7×
“On the one hand, tensor contraction works best for shallow circuits with a small treewidth [62, 66].”
BackgroundMethodInfluentialQuantum Information Scrambling in a Trapped-Ion Quantum Simulator with Tunable Range Interactions
Joshi, M. K., Elben, A., Vermersch, B., Brydges, T., Maier, C., Zoller, P., Blatt, R., & Roos, C. F. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.240505 · Cited by 176
quimb: A python package for quantum information and many-body calculations
Gray, J. (2018) · Journal of Open Source Software · doi:10.21105/joss.00819 · Cited by 172 · cited 1×
“In our numerical simulations, we used cotengra [62] and quimb [72] to identify the best contraction (including slicing) and perform the actual tensor contraction respectively.”
MethodVelocity-dependent Lyapunov exponents in many-body quantum, semiclassical, and classical chaos
Khemani, V., Huse, D. A., & Nahum, A. (2018) · Physical Review B · doi:10.1103/physrevb.98.144304 · Cited by 168
Villalonga, B., Boixo, S., Nelson, B., Henze, C., Rieffel, E., Biswas, R., & Mandrà, S. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0196-1 · Cited by 156 · cited 4×
“The sustained performance of 64% is consistent with similar analysis on the NASA cluster [61].”
BackgroundMethodResultInfluentialSelf-citationProbing Scrambling Using Statistical Correlations between Randomized Measurements
Vermersch, B., Elben, A., Sieberer, L. M., Yao, N. Y., & Zoller, P. (2019) · Physical Review X · doi:10.1103/physrevx.9.021061 · Cited by 155
Operator entanglement entropy of the time evolution operator in chaotic systems
Zhou, T., & Luitz, D. J. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.95.094206 · Cited by 145 · cited 1×
“Reduced density matrix of a half-system is introduced using the analogy between operators and states in a doubled space, see for example [75], ρij = 1 22n ∑”
MethodEfficient Unitary Designs with a System-Size Independent Number of Non-Clifford Gates
Haferkamp, J., Montealegre‐Mora, F., Heinrich, M., Eisert, J., Gross, D., & Roth, I. (2022) · Communications in Mathematical Physics · doi:10.1007/s00220-022-04507-6 · Cited by 143
Scrambling speed of random quantum circuitsPreprint
Brown, W., & Fawzi, O. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.6644 · Cited by 123
Thermal diffusivity and chaos in metals without quasiparticles
Blake, M., Davison, R. A., & Sachdev, S. (2017) · Physical Review D · doi:10.1103/physrevd.96.106008 · Cited by 123
Density Matrix Renormalization Group in the Heisenberg Picture
Hartmann, M. J., Prior, J., Clark, S. R., & Plenio, M. B. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.057202 · Cited by 105
Maximum velocity quantum circuits
Claeys, P. W., & Lamacraft, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033032 · Cited by 105
Information Scrambling over Bipartitions: Equilibration, Entropy Production, and Typicality
Styliaris, G., Anand, N., & Zanardi, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.030601 · Cited by 104
Absence of exponential sensitivity to small perturbations in nonintegrable systems of spins 1/2
Fine, B. V., Elsayed, T. A., Kropf, C. M., & de Wijn, A. S. (2014) · Physical Review E · doi:10.1103/physreve.89.012923 · Cited by 76
Resilience of scrambling measurements
Swingle, B. G., & Halpern, N. Y. (2018) · Physical Review A · doi:10.1103/physreva.97.062113 · Cited by 75
Scrambling and complexity in phase space
Zhuang, Q., Schuster, T., Yoshida, B., & Yao, N. Y. (2019) · Physical Review A · doi:10.1103/physreva.99.062334 · Cited by 74
Classical Simulation of Quantum Supremacy Circuits
Huang, C., Zhang, F., Newman, M., Cai, J., Gao, X., Tian, Z., Wu, J., Xu, H., Yu, H., Yuan, B., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.06787 · Cited by 74
Self-citationSimulation of low-depth quantum circuits as complex undirected graphical models
Boixo, S., Isakov, S. V., Smelyanskiy, V., & Neven, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.05384 · Cited by 72 · cited 1×
“On the one hand, tensor contraction works best for shallow circuits with a small treewidth [62, 66].”
BackgroundSelf-citationClassical Simulation of Intermediate-Size Quantum Circuits
Chen, J., Zhang, F., Huang, C., Newman, M., & Shi, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.01450 · Cited by 70
Self-citationEfficient decoding for the Hayden-Preskill protocol
Yoshida, B., & Kitaev, A. (2017) · arXiv · doi:10.48550/arxiv.1710.03363 · Cited by 64 · cited 1×
“OTOC in this limit takes the value corresponding to the random matrix statistics [73].”
BackgroundSelf-citationStrange metal from local quantum chaos
Ben-Zion, D., & McGreevy, J. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.155117 · Cited by 64
TOWARDS THE FAST SCRAMBLING CONJECTURE
Hayden, P. M. (2013) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789814449243_0055 · Cited by 52
Quantum Supremacy Is Both Closer and Farther than It Appears
Markov, I. L., Fatima, A., Isakov, S. V., & Boixo, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.10749 · Cited by 46
Self-citationObservations outside the light cone: Algorithms for nonequilibrium and thermal states
Hastings, M. B. (2008) · Physical Review B · doi:10.1103/physrevb.77.144302 · Cited by 27 · cited 1×
“This typically results in a “light-cone” structure for many quantum circuits, which can be capitalized to reduce their classical simulation costs [57].”
BackgroundHaferkamp, J., Montealegre‐Mora, F., Heinrich, M., et al. (2020) · arXiv (Cornell University) · Cited by 22
Faster classical sampling from distributions defined by quantum circuits
Markov, I. L., Fatima, A., Isakov, S. V., & Boixo, S. (2019) · Bulletin of the American Physical Society · Cited by 1
Self-citation
Research works printed but not linked: 2
- R. K. Shukla G. K. Naik S. K. Mishra Out-of-time-order correlation and detection of phase structure in Floquet transverse Ising spin system. arXiv:2002.05986 [cond-mat.stat-mech] c4100}}}{{\rtlch\fcs1\af0\ltrch\fcs0\cs30\ulw\cf2\insrsid8798952\charrsid8284585 arXiv:2002(2020). · arXiv
- J. Gray S. Kourtis Hyper-optimized tensor network contraction. arXiv:2002.01935 [quant-ph]048dd}}}{{\rtlch\fcs1\af0\ltrch\fcs0\cs30\ulw\cf2\insrsid8798952\charrsid4787150 arXiv:2002 (2021). · arXiv
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“Even though Clifford circuits create superposition and entanglement between qubits, the N initial stabilizers of the state can simply be tracked as they propagate through the circuit (so-called operator spreading 94 ) and thereby simulation of the circuit can be easily accomplished.”
BackgroundCai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
“In some particular use cases like measuring the out-of-time-order correlator (Mi et al. , 2021), by simply removing/replacing a small number of gates of the primary circuit, one can analytically derive the output of the resultant circuits, which can also be used as the training circuits.”
BackgroundMethodSelf-citationFisher, M. P. A., Khemani, V., Nahum, A., & Vijay, S. (2023) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031720-030658 · Cited by 456
“(291) furnished a detailed experimental study of information scrambling in a variety of chaotic quantum circuits by measuring out-of-time-ordered commutators using ancillaassisted methods.”
BackgroundTime-crystalline eigenstate order on a quantum processor
Mi, X., Ippoliti, M., Quintana, C., Greene, A., Chen, Z., Gross, J., Arute, F., Arya, K., Atalaya, J., Babbush, R., et al. (2022) · Nature · doi:10.1038/s41586-021-04257-w · Cited by 334
Self-citation
Metadata
- Authors
- Mi, X., Roushan, P., Quintana, C., Mandrà, S., Marshall, J., Neill, C., Arute, F., Arya, K., Atalaya, J., Babbush, R., Bardin, J. C., Barends, R., Basso, J., Bengtsson, A., Boixo, S., Bourassa, A., Broughton, M., Buckley, B. B., Buell, D. A., Burkett, B., Bushnell, N., Chen, Z., Chiaro, B., Collins, R., Courtney, W., Demura, S., Derk, A. R., Dunsworth, A., Eppens, D., Erickson, C., Farhi, E., Fowler, A. G., Foxen, B., Gidney, C., Giustina, M., Gross, J. A., Harrigan, M. P., Harrington, S. D., Hilton, J., Ho, A., Hong, S., Huang, T., Huggins, W. J., Ioffe, L. B., Isakov, S. V., Jeffrey, E., Jiang, Z., Jones, C., Kafri, D., Kelly, J., Kim, S., Kitaev, A., Klimov, P. V., Korotkov, A. N., Kostritsa, F., Landhuis, D., Laptev, P., Lucero, E., Martin, O., McClean, J. R., McCourt, T., McEwen, M., Megrant, A., Miao, K. C., Mohseni, M., Montazeri, S., Mruczkiewicz, W., Mutus, J., Naaman, O., Neeley, M., Newman, M., Niu, M. Y., O’Brien, T. E., Opremcak, A., Ostby, E., Pato, B., Petukhov, A., Redd, N., Rubin, N. C., Sank, D., Satzinger, K. J., Shvarts, V., Strain, D., Szalay, M., Trevithick, M. D., Villalonga, B., White, T., Yao, Z. J., Yeh, P., Zalcman, A., Neven, H., Aleiner, I., Kechedzhi, K., Smelyanskiy, V., & Chen, Y.
- Affiliations
- Google (United States) (US)
- Ames Research Center (US)
- Google Research, Mountain View, CA, USA.
- California Institute of Technology (US)
- University of California, Riverside (US)
- Corresponding author
- Mi, Xiao
- Roushan, Pedram
- Quintana, Chris
- Kechedzhi, Kostyantyn
- Smelyanskiy, Vadim
- Chen, Yu
- ORCID
- Mi, Xiao
- Roushan, Pedram
- Quintana, Chris
- Mandrà, Salvatore
- Marshall, Jeffrey
- Neill, Charles
- Arute, Frank
- Arya, Kunal
- Atalaya, Juan
- Babbush, Ryan
- Bardin, Joseph C.
- Basso, Joao
- Bengtsson, Andreas
- Boixo, Sergio
- Bourassa, Alexandre
- Broughton, Michael
- Buckley, Bob B.
- Burkett, Brian
- Bushnell, Nicholas
- Chen, Zijun
- Collins, Roberto
- Demura, Sean
- Dunsworth, Andrew
- Eppens, Daniel
- Erickson, Catherine
- Farhi, Edward
- Fowler, Austin G.
- Foxen, Brooks
- Giustina, Marissa
- Gross, Jonathan A.
- Harrigan, Matthew P.
- Harrington, Sean D.
- Hong, Sabrina
- Huang, Trent
- Huggins, William J.
- Ioffe, L. B.
- Jeffrey, Evan
- Jiang, Zhang
- Kafri, Dvir
- Kelly, Julian
- Kim, Seon
- Kitaev, Alexei
- Klimov, Paul V.
- Korotkov, Alexander N.
- Landhuis, David
- Lucero, Erik
- Martin, Orion
- McClean, Jarrod R.
- McCourt, Trevor
- McEwen, Matt
- Megrant, Anthony
- Miao, Kevin C.
- Mohseni, Masoud
- Montazeri, Shirin
- Mruczkiewicz, Wojciech
- Mutus, Josh
- Naaman, Ofer
- Neeley, Matthew
- Newman, Michael
- Niu, Murphy Yuezhen
- O’Brien, Thomas E.
- Redd, Nicholas
- Rubin, Nicholas C.
- Sank, Daniel
- Satzinger, Kevin J.
- Szalay, Marco
- Trevithick, Matthew D.
- Villalonga, Benjamin
- White, Theodore
- Yao, Z. Jamie
- Yeh, Ping
- Zalcman, Adam
- Neven, Hartmut
- Kechedzhi, Kostyantyn
- Smelyanskiy, Vadim
- Chen, Yu
- Venue
- Science
- Published
- 2021-12-17
- Volume
- 374
- Issue
- 6574
- Pages
- 1479-1483
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W3210539808
- Cited by
- 283
- References
- 81
- Citations by year
- 2026: 34 · 2025: 57 · 2024: 59 · 2023: 68 · 2022: 49 · 2021: 15
- FWCI
- 20.75
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum scrambling, out-of-time-order correlators, operator spreading, operator entanglement, quantum chaos, classical simulation of quantum dynamics
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.