Fetching the paper…
Reading the bibliography…
We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates.
Cryptographic hardness of distribution-specific learning
Michael Kharitonov · 1993
Earlier work this paper cites.
Constant depth circuits, Fourier transform, and learnability
Nathan Linial, Yishay Mansour, and Noam Nisan · 1993
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997
Earlier work this paper cites.
Quantum circuits: Fanout, parity, and counting
Cristopher Moore · 1999
Earlier work this paper cites.
A simple formula for the average gate fidelity of a quantum dynamical operation
Michael A Nielsen · 2002
Earlier work this paper cites.
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games
Barbara M Terhal and David P DiVincenzo · 2002
Earlier work this paper cites.
Quantum fan-out is powerful
Peter Høyer and Robert Špalek · 2005
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2009
Earlier work this paper cites.
Quantum boolean functions
Ashley Montanaro and Tobias J Osborne · 2010
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A Nielsen and Isaac L Chuang · 2010
Earlier work this paper cites.
Quantum Information Theory
Mark M Wilde · 2013
Earlier work this paper cites.
Analysis of Boolean Functions
Ryan O’Donnell · 2014
Earlier work this paper cites.
Hand-waving and interpretive dance: an introductory course on tensor networks
Jacob C Bridgeman and Christopher T Chubb · 2017
Earlier work this paper cites.
Quantum supremacy for simulating a translation-invariant ising spin model
Xun Gao, Sheng-Tao Wang, and L-M Duan · 2017
Earlier work this paper cites.
Shadow tomography of quantum states
Scott Aaronson · 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.
Architectures for quantum simulation showing a quantum speedup
Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz, Robert Raussendorf, and Jens Eisert · 2018
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
Earlier work this paper cites.
Quantum advantage with noisy shallow circuits
Sergey Bravyi, David Gosset, Robert König, and Marco Tomamichel · 2020
Cited alongside, same era.
Efficient estimation of Pauli channels
Steven T Flammia and Joel J Wallman · 2020
Cited alongside, same era.
Closing gaps of a quantum advantage with short-time hamiltonian dynamics
Jonas Haferkamp, Dominik Hangleiter, Adam Bouland, Bill Fefferman, Jens Eisert, and Juani Bermejo-Vega · 2020
Cited alongside, same era.
Predicting many properties of a quantum system from very few measurements
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2020
Cited alongside, same era.
Quantum hardness of learning shallow classical circuits
Srinivasan Arunachalam, Alex Bredariol Grilo, and Aarthi Sundaram · 2021
Cited alongside, same era.
Improved quantum data analysis
Costin Bădescu and Ryan O’Donnell · 2021
Cited alongside, same era.
Computational advantage of quantum random sampling
Dominik Hangleiter and Jens Eisert · 2023
Later among the works it cites.
Unconditional quantum advantage for sampling with shallow circuits
Adam Bene Watts and Natalie Parham · 2023
Later among the works it cites.
Robust and efficient Hamiltonian learning
Wenjun Yu, Jinzhao Sun, Zeyao Han, and Xiao Yuan · 2023
Later among the works it cites.
Learning quantum states and unitaries of bounded gate complexity
Haimeng Zhao, Laura Lewis, Ishaan Kannan, Yihui Quek, Hsin-Yuan Huang, and Matthias C Caro · 2023
Later among the works it cites.
On the Computational Power of QAC0 with Barely Superlinear Ancillae
Anurag Anshu, Yangjing Dong, Fengning Ou, and Penghui Yao · 2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Pauli error estimation via population recovery
Steven T Flammia and Ryan O’Donnell · 2021
Cited alongside, same era.
Generalization in quantum machine learning from few training data
Matthias C Caro, Hsin-Yuan Huang, Marco Cerezo, Kunal Sharma, Andrew Sornborger, Lukasz Cincio, and Patrick J Coles · 2022
Cited alongside, same era.
Quantum advantages for Pauli channel estimation
Senrui Chen, Sisi Zhou, Alireza Seif, and Liang Jiang · 2022
Cited alongside, same era.
Quantum advantage in learning from experiments
Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, et al · 2022
Cited alongside, same era.
Learning quantum circuits of some T gates
Ching-Yi Lai and Hao-Chung Cheng · 2022
Cited alongside, same era.
Nearly optimal algorithms for testing and learning quantum junta channels
Zongbo Bao and Penghui Yao · 2023
Cited alongside, same era.
Structure learning of Hamiltonians from real-time evolution
Ainesh Bakshi, Allen Liu, Ankur Moitra, and Ewin Tang · 2024
Closest in time.
Learning quantum processes and hamiltonians via the pauli transfer matrix
Matthias C Caro · 2024
Closest in time.
Tight bounds on pauli channel learning without entanglement
Senrui Chen, Changhun Oh, Sisi Zhou, Hsin-Yuan Huang, and Liang Jiang · 2024
Closest in time.
Predicting quantum channels over general product distributions
Sitan Chen, Jaume de Dios Pont, Jun-Ting Hsieh, Hsin-Yuan Huang, Jane Lange, and Jerry Li · 2024
Closest in time.
Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits
Yuxuan Du, Min-Hsiu Hsieh, and Dacheng Tao · 2024
Closest in time.
Improved stabilizer estimation via bell difference sampling
Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang · 2024
Closest in time.
Learning junta distributions and quantum junta states, and QAC0 circuits
Francisco Escudero Gutierrez · 2024
Closest in time.
Learning quantum Hamiltonians from high-temperature Gibbs states and real-time evolutions
Jeongwan Haah, Robin Kothari, and Ewin Tang · 2024
Closest in time.
Learning shallow quantum circuits, 2024
Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, and Jarrod R. McClean · 2024
Closest in time.
Learning t-doped stabilizer states
Lorenzo Leone, Salvatore FE Oliviero, and Alioscia Hamma · 2024
Closest in time.
On the Pauli Spectrum of QAC0
Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, and Henry Yuen · 2024
Closest in time.
Efficient and robust estimation of many-qubit Hamiltonians
Daniel Stilck França, Liubov A Markovich, VV Dobrovitski, Albert H Werner, and Johannes Borregaard · 2024
Closest in time.