Fetching the paper…
Reading the bibliography…
Over a decade after its proposal, the idea of using quantum computers to sample hard distributions has remained a key path to demonstrating quantum advantage.
Distribution of eigenvalues for some sets of random matrices
V A Marčenko and L A Pastur · 1967
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
Level-spacing distributions and the airy kernel
Craig A Tracy and Harold Widom · 1994
Earlier work this paper cites.
A geometric approach to quantum circuit lower bounds
Michael A Nielsen · 2005
Earlier work this paper cites.
Entanglement of random vectors
Marko Žnidarič · 2006
Earlier work this paper cites.
Quantum t-designs: t-wise independence in the quantum world
Andris Ambainis and Joseph Emerson · 2007
Earlier work this paper cites.
Evenly distributed unitaries: On the structure of unitary designs
David Gross, Koenraad Audenaert, and Jens Eisert · 2007
Earlier work this paper cites.
Extreme statistics of complex random and quantum chaotic states
Arul Lakshminarayan, Steven Tomsovic, Oriol Bohigas, and Satya N Majumdar · 2008
Earlier work this paper cites.
Exact and approximate unitary 2-designs and their application to fidelity estimation
Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine · 2009
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.
Bosonsampling is far from uniform
Scott Aaronson and Alex Arkhipov · 2013
Earlier work this paper cites.
Universal computation by multiparticle quantum walk
Andrew M Childs, David Gosset, and Zak Webb · 2013
Earlier work this paper cites.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Earlier work this paper cites.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien · 2014
Earlier work this paper cites.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2016
Earlier work this paper cites.
Gorjan Alagic and Bill Fefferman · 2016
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 supremacy through the quantum approximate optimization algorithm
Edward Farhi and Aram W Harrow · 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.
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Abhinav Kandala, Antonio Mezzacapo, Kristan Temme, Maika Takita, Markus Brink, Jerry M Chow, and Jay M Gambetta · 2017
Cited alongside, same era.
Quantum supremacy and the complexity of random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2018
Cited alongside, same era.
quimb: a python library for quantum information and many-body calculations
Johnnie Gray · 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.
Barren plateaus in quantum neural network training landscapes
Jarrod R McClean, Sergio Boixo, Vadim N Smelyanskiy, Ryan Babbush, and Hartmut Neven · 2018
Cited alongside, same era.
Limitations of linear cross-entropy as a measure for quantum advantage
Xun Gao, Marcin Kalinowski, Chi-Ning Chou, Mikhail D Lukin, Boaz Barak, and Soonwon Choi · 2021
Later among the works it cites.
The variational power of quantum circuit tensor networks, 2021
Reza Haghshenas, Johnnie Gray, Andrew C. Potter, and Garnet Kin-Lic Chan · 2021
Later among the works it cites.
Qed driven qaoa for network-flow optimization
Yuxuan Zhang, Ruizhe Zhang, and Andrew C Potter · 2021
Later among the works it cites.
Classically simulating quantum supremacy iqp circuits trough a random graph approach
Julien Codsi and John van de Wetering · 2022
Later among the works it cites.
Random quantum circuits anticoncentrate in log depth
Alexander M Dalzell, Nicholas Hunter-Jones, and Fernando GSL Brandao · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ramis Movassagh · 2018
Cited alongside, same era.
Quantum computing in the nisq era and beyond
John Preskill · 2018
Cited alongside, same era.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando Brandao, David Buell, Brian Burkett, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks Foxen, and John Martinis · 2019
Cited alongside, same era.
An adaptive variational algorithm for exact molecular simulations on a quantum computer
Harper R Grimsley, Sophia E Economou, Edwin Barnes, and Nicholas J Mayhall · 2019
Cited alongside, same era.
Unitary designs from statistical mechanics in random quantum circuits
Nicholas Hunter-Jones · 2019
Cited alongside, same era.
Forging quantum data: classically defeating an iqp-based quantum test
Gregory D Kahanamoku-Meyer · 2019
Cited alongside, same era.
Pytorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, et al · 2019
Cited alongside, same era.
Random quantum circuits are approximate unitary t t -designs in depth O ( n t 5 + o ( 1 ) ) O\left(nt^{5+o(1)}\right)
Jonas Haferkamp · 2022
Later among the works it cites.
Classically verifiable quantum advantage from a computational bell test
Gregory D Kahanamoku-Meyer, Soonwon Choi, Umesh V Vazirani, and Norman Y Yao · 2022
Later among the works it cites.
Quantum computational advantage with a programmable photonic processor
Lars S Madsen, Fabian Laudenbach, Mohsen Falamarzi Askarani, Fabien Rortais, Trevor Vincent, Jacob FF Bulmer, Filippo M Miatto, Leonhard Neuhaus, Lukas G Helt, Matthew J Collins, et al · 2022
Later among the works it cites.
Solving the sampling problem of the sycamore quantum circuits
Feng Pan, Keyang Chen, and Pan Zhang · 2022
Later among the works it cites.
Verifiable quantum advantage without structure
Takashi Yamakawa and Mark Zhandry · 2022
Later among the works it cites.
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling
Qingling Zhu, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, et al · 2022
Later among the works it cites.
Qubit-efficient simulation of thermal states with quantum tensor networks
Yuxuan Zhang, Shahin Jahanbani, Daoheng Niu, Reza Haghshenas, and Andrew C Potter · 2022
Later among the works it cites.
Iqp sampling and verifiable quantum advantage: Stabilizer scheme and classical security
Michael J Bremner, Bin Cheng, and Zhengfeng Ji · 2023
Later among the works it cites.
Obfuscation of pseudo-deterministic quantum circuits
James Bartusek, Fuyuki Kitagawa, Ryo Nishimaki, and Takashi Yamakawa · 2023
Later among the works it cites.
Designs from local random quantum circuits with su (d) symmetry
Zimu Li, Han Zheng, Junyu Liu, Liang Jiang, and Zi-Wen Liu · 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.
Spoofing cross-entropy measure in boson sampling
Changhun Oh, Liang Jiang, and Bill Fefferman · 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.
Fast classical simulation of harvard/quera iqp circuits
Dmitri Maslov, Sergey Bravyi, Felix Tripier, Andrii Maksymov, and Joe Latone · 2024
Closest in time.
Polynomial-time classical simulation of noisy iqp circuits with constant depth
Joel Rajakumar, James D Watson, and Yi-Kai Liu · 2024
Closest in time.
Sequential quantum simulation of spin chains with a single circuit qed device
Yuxuan Zhang, Shahin Jahanbani, Ameya Riswadkar, S Shankar, and Andrew C Potter · 2024
Closest in time.