Fetching the paper…
Reading the bibliography…
Establishing an advantage for (white-box) computations by a quantum computer against its classical counterpart is currently a key goal for the quantum computation community.
The computational complexity of (XOR, AND)-counting problems
Andrzej Ehrenfeucht and Marek Karpinski · 1990
Earlier work this paper cites.
Temporally unstructured quantum computation
Dan Shepherd and Michael J. Bremner · 2009
Earlier work this paper cites.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Earlier work this paper cites.
Quantum computing and the entanglement frontier
John Preskill · 2012
Earlier work this paper cites.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2016
Earlier work this paper cites.
Encoding electronic spectra in quantum circuits with linear T complexity
Ryan Babbush, Craig Gidney, Dominic W. Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven · 2018
Earlier work this paper cites.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Earlier work this paper cites.
Leveraging secondary storage to simulate deep 54-qubit Sycamore circuits
Edwin Pednault, John A. Gunnels, Giacomo Nannicini, Lior Horesh, and Robert Wisnieff · 2019
Cited alongside, same era.
Simulation of quantum circuits by low-rank stabilizer decompositions
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2019
Cited alongside, same era.
Low-cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
Yunseong Nam and Dmitri Maslov · 2019
Cited alongside, same era.
How many qubits are needed for quantum computational supremacy?
Alexander M. Dalzell, Aram W. Harrow, Dax Enshan Koh, and Rolando L. La Placa · 2020
Cited alongside, same era.
Classically simulating quantum supremacy IQP circuits through a random graph approach
Julien Codsi and John van de Wetering · 2022
Robust sparse IQP sampling in constant depth
Louis Paletta, Anthony Leverrier, Alain Sarlette, Mazyar Mirrahimi, and Christophe Vuillot · 2023
Later among the works it cites.
Norman P. Jouppi, George Kurian, Sheng Li, Peter Ma, Rahul Nagarajan, Lifeng Nai, Nishant Patil, Suvinay Subramanian, Andy Swing, Brian Towles, Cliff Young, Xiang Zhou, Zongwei Zhou, and David Patterson · 2023
Later among the works it cites.
Fault-tolerant one-bit addition with the smallest interesting colour code
Yang Wang, Selwyn Simsek, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst, Mitchell Matheny, Tanner Mengle, et al · 2023
Later among the works it cites.
Logical quantum processor based on reconfigurable atom arrays
Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, et al · 2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
How to simulate quantum measurement without computing marginals
Sergey Bravyi, David Gosset, and Yinchen Liu · 2022
Cited alongside, same era.
A polynomial-time classical algorithm for noisy random circuit sampling
Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, and Umesh Vazirani · 2023
Cited alongside, same era.
We expect that the runtime is dominated by computing O ( 1 ) O(1) amplitudes corresponding to subcircuits in which the final Hadamard layer is nearly full. Indeed, removing a Hadamard gate is equivalent to setting the corresponding qubit to 0 0 or 1 1 throughout the circuit. Such a qubit does not support any superpositions and can be easily removed from the simulation by properly modifying the rest of the circuit
Cited in the paper.
The tested C++ implementation treats blue and green qubits on the same footing. Accordingly, the CZ
Cited in the paper.
Harvard/QuEra Phase Polynomial Circuit Simulation
Sergey Bravyi and Felix Tripier · 2024
Closest in time.
https://gcloud-compute.com/c2d-highcpu-112.html , 2024
Google compute engine machine type c2d-highcpu-112 · 2024
Closest in time.
Private communication, January 22, 2024
Dolev Bluvstein and Mikhail Lukin · 2024
Closest in time.