Fetching the paper…
Reading the bibliography…
We study random constant-depth quantum circuits in a two-dimensional architecture.
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games
Barbara M. Terhal and David P. DiVincenzo · 2004
Earlier work this paper cites.
Graphical description of the action of local clifford transformations on graph states
Maarten Van den Nest, Jeroen Dehaene, and Bart De Moor · 2004
Earlier work this paper cites.
Local random quantum circuits are approximate polynomial-designs
Fernando GSL Brandao, Aram W Harrow, and Michał Horodecki · 2016
Earlier work this paper cites.
Quantum computational supremacy
Aram W Harrow and Ashley Montanaro · 2017
Earlier work this paper cites.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2017
Earlier work this paper cites.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven · 2018
Earlier work this paper cites.
Quantum zeno effect and the many-body entanglement transition
Yaodong Li, Xiao Chen, and Matthew P. A. Fisher · 2018
Earlier work this paper cites.
Quantum advantage with shallow circuits
Sergey Bravyi, David Gosset, and Robert König · 2018
Earlier work this paper cites.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al · 2019
Earlier work this paper cites.
Measurement-induced phase transitions in the dynamics of entanglement
Brian Skinner, Jonathan Ruhman, and Adam Nahum · 2019
Earlier work this paper cites.
Unitary-projective entanglement dynamics
Amos Chan, Rahul M. Nandkishore, Michael Pretko, and Graeme Smith · 2019
Earlier work this paper cites.
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
Adam Bene Watts, Robin Kothari, Luke Schaeffer, and Avishay Tal · 2019
Cited alongside, same era.
Average-case quantum advantage with shallow circuits
François Le Gall · 2019
Cited alongside, same era.
Unitary designs from statistical mechanics in random quantum circuits
Nicholas Hunter-Jones · 2019
Cited alongside, same era.
Quantum advantage with noisy shallow circuits
Sergey Bravyi, David Gosset, Robert König, and Marco Tomamichel · 2020
Cited alongside, same era.
Interactive shallow clifford circuits: Quantum advantage against nc¹ and beyond
Daniel Grier and Luke Schaeffer · 2020
Cited alongside, same era.
Benchmarking near-term quantum computers via random circuit sampling
Measurement-induced entanglement transition in a two-dimensional shallow circuit
Hanchen Liu, Tianci Zhou, and Xiao Chen · 2022
Later among the works it cites.
Single-qubit gate teleportation provides a quantum advantage
Libor Caha, Xavier Coiteux-Roy, and Robert Koenig · 2022
Later among the works it cites.
Random quantum circuits anticoncentrate in log depth
Alexander M. Dalzell, Nicholas Hunter-Jones, and Fernando G. S. L. Brandão · 2022
Later among the works it cites.
How to simulate quantum measurement without computing marginals
Sergey Bravyi, David Gosset, and Yinchen Liu · 2022
Later among the works it cites.
Random quantum circuits
Matthew PA Fisher, Vedika Khemani, Adam Nahum, and Sagar Vijay · 2023
Later among the works it cites.
Measurement-induced entanglement and teleportation on a noisy quantum processor
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yunchao Liu, Matthew Otten, Roozbeh Bassirianjahromi, Liang Jiang, and Bill Fefferman · 2021
Cited alongside, same era.
Trading locality for time: certifiable randomness from low-depth circuits
Matthew Coudron, Jalex Stark, and Thomas Vidick · 2021
Cited alongside, same era.
Stim: a fast stabilizer circuit simulator
Craig Gidney · 2021
Cited alongside, same era.
Moments of random quantum circuits and applications in random circuit sampling
Yinchen Liu · 2021
Cited alongside, same era.
Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits
Boaz Barak, Chi-Ning Chou, and Xun Gao · 2021
Cited alongside, same era.
Efficient classical simulation of random shallow 2d quantum circuits
John C. Napp, Rolando L. La Placa, Alexander M. Dalzell, Fernando G. S. L. Brandão, and Aram W. Harrow · 2022
Cited alongside, same era.
In particular, if U U is a coarse-grained circuit and O j O_{j} is an operator acting on qubit j j , then the support of U O j U † UO_{j}U^{\dagger} is contained within a square region of size O ( τ 2 ) O(\tau^{2}) centered at j j
Cited in the paper.
Google Quantum AI and Collaborators · 2023
Later among the works it cites.
Libor Caha, Xavier Coiteux-Roy, and Robert Koenig · 2023
Later among the works it cites.
Local random quantum circuits form approximate designs on arbitrary architectures
Shivan Mittal and Nicholas Hunter-Jones · 2023
Later among the works it cites.
Finite-time teleportation phase transition in random quantum circuits
Yimu Bao, Maxwell Block, and Ehud Altman · 2024
Closest in time.
Random unitaries in extremely low depth
Thomas Schuster, Jonas Haferkamp, and Hsin-Yuan Huang · 2024
Closest in time.
Approximate unitary k k -designs from shallow, low-communication circuits
Nicholas LaRacuente and Felix Leditzky · 2024
Closest in time.