Fetching the paper…
Reading the bibliography…
What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters.
Representations of lie groups and special functions
AU Klimyk and N Ya Vilenkin · 1995
Earlier work this paper cites.
The heisenberg representation of quantum computers
Daniel Gottesman · 1998
Earlier work this paper cites.
The computational complexity to evaluate representations of general linear groups
Peter Bürgisser · 2000
Earlier work this paper cites.
Classical simulation of noninteracting-fermion quantum circuits
Barbara M Terhal and David P DiVincenzo · 2002
Earlier work this paper cites.
Decoherence, einselection, and the quantum origins of the classical
Wojciech Hubert Zurek · 2003
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Matchgates and classical simulation of quantum circuits
Richard Jozsa and Akimasa Miyake · 2008
Earlier work this paper cites.
Symmetry, representations, and invariants
Roe Goodman, Nolan R Wallach, et al · 2009
Earlier work this paper cites.
Interacting quantum observables: categorical algebra and diagrammatics
Bob Coecke and Ross Duncan · 2011
Earlier work this paper cites.
Improved classical simulation of quantum circuits dominated by clifford gates
Sergey Bravyi and David Gosset · 2016
Earlier work this paper cites.
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 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.
Efficient classical simulation of noisy quantum computation
Xun Gao and Luming Duan · 2018
Earlier work this paper cites.
Titchmarsh theorems for fourier transforms of hölder–lipschitz functions on compact homogeneous manifolds
Radouan Daher, Julio Delgado, and Michael Ruzhansky · 2019
Earlier work this paper cites.
Asymptotics of quantum channels: conserved quantities, an adiabatic limit, and matrix product states
Victor V Albert · 2019
Cited alongside, same era.
Efficient classical simulation and benchmarking of quantum processes in the weyl basis
Daniel Stilck França, Sergii Strelchuk, and Michał Studziński · 2021
Cited alongside, same era.
Limitations of optimization algorithms on noisy quantum devices
Daniel Stilck França and Raul Garcia-Patron · 2021
Cited alongside, same era.
How to simulate quantum measurement without computing marginals
Sergey Bravyi, David Gosset, and Yinchen Liu · 2022
Cited alongside, same era.
Benoit Collins, Sho Matsumoto, and Jonathan Novak · 2022
Cited alongside, same era.
Computational advantage of quantum random sampling
Efficient classical algorithms for simulating symmetric quantum systems
Eric R Anschuetz, Andreas Bauer, Bobak T Kiani, and Seth Lloyd · 2023
Later among the works it cites.
Lie-algebraic classical simulations for variational quantum computing
Matthew L Goh, Martin Larocca, Lukasz Cincio, M Cerezo, and Frédéric Sauvage · 2023
Later among the works it cites.
Fourier expansion in variational quantum algorithms
Nikita A Nemkov, Evgeniy O Kiktenko, and Aleksey K Fedorov · 2023
Later among the works it cites.
The computational power of random quantum circuits in arbitrary geometries
Matthew DeCross, Reza Haghshenas, Minzhao Liu, Yuri Alexeev, Charles H Baldwin, John P Bartolotta, Matthew Bohn, Eli Chertkov, Jonhas Colina, Davide DelVento, et al · 2024
Closest in time.
Noise-induced shallow circuits and absence of barren plateaus
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dominik Hangleiter and Jens Eisert · 2023
Cited alongside, same era.
Phase transition in random circuit sampling
Alexis Morvan, B Villalonga, X Mi, S Mandra, A Bengtsson, PV Klimov, Z Chen, S Hong, C Erickson, IK Drozdov, et al · 2023
Cited alongside, same era.
The complexity of nisq
Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li · 2023
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.
Classical simulations of noisy variational quantum circuits
Enrico Fontana, Manuel S Rudolph, Ross Duncan, Ivan Rungger, and Cristina Cîrstoiu · 2023
Cited alongside, same era.
Simulating quantum mean values in noisy variational quantum algorithms: A polynomial-scale approach
Yuguo Shao, Fuchuan Wei, Song Cheng, and Zhengwei Liu · 2023
Cited alongside, same era.
Classical surrogate simulation of quantum systems with lowesa
Manuel S Rudolph, Enrico Fontana, Zoë Holmes, and Lukasz Cincio · 2023
Cited alongside, same era.
Antonio Anna Mele, Armando Angrisani, Soumik Ghosh, Sumeet Khatri, Jens Eisert, Daniel Stilck França, and Yihui Quek · 2024
Closest in time.
High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
C Ryan-Anderson, NC Brown, CH Baldwin, JM Dreiling, C Foltz, JP Gaebler, TM Gatterman, N Hewitt, C Holliman, CV Horst, et al · 2024
Closest in time.
Fault-tolerant one-bit addition with the smallest interesting color 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 · 2024
Closest in time.
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.
Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
Tomislav Begušić, Johnnie Gray, and Garnet Kin-Lic Chan · 2024
Closest in time.
Fast classical simulation of quantum circuits via parametric rewriting in the zx-calculus
Matthew Sutcliffe and Aleks Kissinger · 2024
Closest in time.
A polynomial-time classical algorithm for noisy quantum circuits
Thomas Schuster, Chao Yin, Xun Gao, and Norman Y Yao · 2024
Closest in time.
Unified framework for efficiently computable quantum circuits
Igor Ermakov, Oleg Lychkovskiy, and Tim Byrnes · 2024
Closest in time.
Pauli path simulations of noisy quantum circuits beyond average case
Guillermo González-García, J Ignacio Cirac, and Rahul Trivedi · 2024
Closest in time.
Classically estimating observables of noiseless quantum circuits
Armando Angrisani, Alexander Schmidhuber, Manuel S Rudolph, M Cerezo, Zoë Holmes, and Hsin-Yuan Huang · 2024
Closest in time.