Fetching the paper…
Reading the bibliography…
Sampling from the output distributions of quantum computations comprising only commuting gates, known as instantaneous quantum polynomial (IQP) computations, is believed to be intractable for classical computers, and hence this task has become a leading candidate for testing the capabilities of quantum devices.
“The chromatic class of a multigraph”
V.. Vizing · 1965
Earlier work this paper cites.
“The edge-coloring of complete hypergraphs I”
Zsolt Baranyai · 1979
Earlier work this paper cites.
“On the LambertW function”
R.. Corless, G.. Gonnet, D… Hare, D.. Jeffrey and D.. Knuth · 1996
Earlier work this paper cites.
“Some Basic Techniques”
Geoffrey Grimmett · 1999
Earlier work this paper cites.
“Permutational quantum computing”
Stephen Jordan · 2009
Earlier work this paper cites.
“Binary Matroids and Quantum Probability Distributions”, 2010
Dan Shepherd · 2010
Earlier work this paper cites.
“Quantum Complexity: restrictions on algorithms and architectures”
Daniel Shepherd · 2010
Earlier work this paper cites.
“The computational complexity of linear optics”
Scott Aaronson and Alex Arkhipov · 2011
Earlier work this paper cites.
“Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy”
Michael Bremner, Richard Jozsa and Dan Shepherd · 2011
Earlier work this paper cites.
“Bounds on the Lambert Function and Their Application to the Outage Analysis of User Cooperation”
Ioannis Chatzigeorgiou · 2013
Earlier work this paper cites.
“The phase transition in site percolation on pseudo-random graphs”
Michael Krivelevich · 2014
Earlier work this paper cites.
“Boson sampling from a Gaussian state”
Austin Lund et al · 2014
Earlier work this paper cites.
“Average-case complexity versus approximate simulation of commuting quantum computations”
Michael Bremner, Ashley Montanaro and Dan Shepherd · 2016
Earlier work this paper cites.
“Computational quantum-classical boundary of noisy commuting quantum circuits”
Keisuke Fujii and Shuhei Tamate · 2016
Earlier work this paper cites.
“Complexity classification of conjugated Clifford circuits”
Adam Bouland, Joseph Fitzsimons and Dax Koh · 2017
Cited alongside, same era.
“Achieving quantum supremacy with sparse and noisy commuting quantum computations”
Michael. Bremner, Ashley Montanaro and Dan. Shepherd · 2017
Cited alongside, same era.
“Continuous-variable sampling from photon-added or photon-subtracted squeezed states”
Ulysse Chabaud et al · 2017
Cited alongside, same era.
“Quantum supremacy for simulating a translation-invariant ising spin model”
Xun Gao, Sheng-Tao Wang and L-M Duan · 2017
Cited alongside, same era.
“Architectures for quantum simulation showing a quantum speedup”
Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz, Robert Raussendorf and Jens Eisert · 2018
Cited alongside, same era.
“Classical simulation of Gaussian quantum circuits with non-Gaussian input states”
Ulysse Chabaud, Giulia Ferrini, Fr“’ed“’eric Grosshans and Damian Markham · 2021
Later among the works it cites.
“Limitations of optimization algorithms on noisy quantum devices”
Daniel Stilcka and Raul Garc“’a-Patr“’on · 2021
Later among the works it cites.
“Strong quantum computational advantage using a superconducting quantum processor”
Yulin Wu et al · 2021
Later among the works it cites.
“Quantum computational advantage with a programmable photonic processor”
Lars Madsen et al · 2022
Later among the works it cites.
“Efficient classical simulation of random shallow 2D quantum circuits”
John Napp, Rolando La, Alexander Dalzell, Fernando Brandao and Aram Harrow · 2022
Later among the works it cites.
“Quantum computational advantage via 60-qubit 24-cycle random circuit sampling”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sergio Boixo et al · 2018
Cited alongside, same era.
“Efficient classical simulation of noisy quantum computation”, 2018
Xun Gao and Luming Duan · 2018
Cited alongside, same era.
“Anticoncentration theorems for schemes showing a quantum speedup”
Dominik Hangleiter, Juan Bermejo-Vega, Martin Schwarz and Jens Eisert · 2018
Cited alongside, same era.
“The Quantum Space Race” Plenary talk at Quantum Information Processing (QIP) 2018. TU Delft, 2018
John Martinis · 2018
Cited alongside, same era.
“Quantum supremacy using a programmable superconducting processor”
Frank Arute et al · 2019
Cited alongside, same era.
“Spoofing linear cross-entropy benchmarking in shallow quantum circuits”
Boaz Barak, Chi-Ning Chou and Xun Gao · 2020
Cited alongside, same era.
“Sampling and the complexity of nature”
Dominik Hangleiter · 2020
Cited alongside, same era.
Qingling Zhu et al · 2022
Later among the works it cites.
“A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling”
Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu and Umesh Vazirani · 2023
Later among the works it cites.
“Logical quantum processor based on reconfigurable atom arrays”
Dolev Bluvstein et al · 2023
Later among the works it cites.
“Computational advantage of quantum random sampling”
Dominik Hangleiter and Jens Eisert · 2023
Later among the works it cites.
“Phase transition in random circuit sampling”
Alexis Morvan et al · 2023
Later among the works it cites.
“Robust sparse IQP sampling in constant depth”, 2023
Louis Paletta, Anthony Leverrier, Alain Sarlette, Mazyar Mirrahimi and Christophe Vuillot · 2023
Later among the works it cites.
“A sharp phase transition in linear cross-entropy benchmarking”
Brayden Ware et al · 2023
Later among the works it cites.
“Fast classical simulation of Harvard/QuEra IQP circuits”
Dmitri Maslov, Sergey Bravyi, Felix Tripier, Andrii Maksymov and Joe Latone · 2024
Closest in time.
“Classical simulability of constant-depth linear-optical circuits with noise”, 2024
Changhun Oh · 2024
Closest in time.