Fetching the paper…
Reading the bibliography…
We consider quantum circuit models where the gates are drawn from arbitrary gate ensembles given by probabilistic distributions over certain gate sets and circuit architectures, which we call stochastic quantum circuits.
Some characters of the symmetric group
S.J. R. E. Ingram · 1950
Earlier work this paper cites.
Doubly stochastic matrices with prescribed positive spectrum
L.F. Martignon · 1984
Earlier work this paper cites.
Approximation by quantum circuits, 1995
E. Knill · 1995
Earlier work this paper cites.
Upper bound on the characters of the symmetric groups
Yuval Roichman · 1996
Earlier work this paper cites.
Increasing Subsequences and the Classical Groups
E. M. Rains · 1998
Earlier work this paper cites.
Time optimal control in spin systems
Navin Khaneja, Roger Brockett, and Steffen J. Glaser · 2001
Earlier work this paper cites.
The symmetric group
Bruce E. Sagan · 2001
Earlier work this paper cites.
Geometric theory of nonlocal two-qubit operations
Jun Zhang, Jiri Vala, K. Birgitta Whaley, and Shankar Sastry · 2003
Earlier work this paper cites.
Moments and cumulants of polynomial random variables on unitarygroups, the itzykson-zuber integral, and free probability
Benoît Collins · 2003
Earlier work this paper cites.
Randomizing quantum states: Constructions and applications
Patrick Hayden, Debbie Leung, Peter W Shor, and Andreas Winter · 2004
Earlier work this paper cites.
Scalable noise estimation with random unitary operators
Joseph Emerson, Robert Alicki, and Karol Życzkowski · 2005
Earlier work this paper cites.
Aspects of generic entanglement
Patrick Hayden, Debbie W. Leung, and Andreas Winter · 2006
Earlier work this paper cites.
Black holes as mirrors: quantum information in random subsystems
Patrick Hayden and John Preskill · 2007
Earlier work this paper cites.
Evenly distributed unitaries: On the structure of unitary designs
D. Gross, K. Audenaert, and J. Eisert · 2007
Earlier work this paper cites.
The emergence of typical entanglement in two-party random processes
O C O Dahlsten, R Oliveira, and M B Plenio · 2007
Earlier work this paper cites.
Generic entanglement can be generated efficiently
R. Oliveira, O. C. O. Dahlsten, and M. B. Plenio · 2007
Earlier work this paper cites.
Generic entanglement can be generated efficiently
R. Oliveira, O. C. O. Dahlsten, and M. B. Plenio · 2007
Earlier work this paper cites.
Optimal two-qubit gate for generation of random bipartite entanglement
Marko Žnidarič · 2007
Earlier work this paper cites.
Randomized benchmarking of quantum gates
Emanuel Knill, Dietrich Leibfried, Rolf Reichle, Joe Britton, R Brad Blakestad, John D Jost, Chris Langer, Roee Ozeri, Signe Seidelin, and David J Wineland · 2008
Earlier work this paper cites.
Optimizing quantum process tomography with unitary 2-designs
A J Scott · 2008
Earlier work this paper cites.
Fast scramblers
Yasuhiro Sekino and L. Susskind · 2008
Earlier work this paper cites.
Parameters of pseudorandom quantum circuits
Yaakov S. Weinstein, Winton G. Brown, and Lorenza Viola · 2008
Earlier work this paper cites.
Quantum pseudorandomness from cluster-state quantum computation
Winton G. Brown, Yaakov S. Weinstein, and Lorenza Viola · 2008
Earlier work this paper cites.
Superadditivity of communication capacity using entangled inputs
M. B. Hastings · 2009
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.
Efficient quantum tensor product expanders and k-designs
Aram W. Harrow and Richard A. Low · 2009
Earlier work this paper cites.
Classical and quantum tensor product expanders
M.B. Hastings and A.W. Harrow · 2009
Earlier work this paper cites.
Random Quantum Circuits are Approximate 2-designs
Aram W. Harrow and Richard A. Low · 2009
Earlier work this paper cites.
Uniform distribution of points on a sphere and some ergodic properties of solutions of linear ordinary differential equations in a complex region
Alexander B. Givental, Boris A. Khesin, Jerrold E. Marsden, Alexander N. Varchenko, Victor A. Vassiliev, Oleg Ya. Viro, and Vladimir M. Zakalyukin, editors · 2009
Earlier work this paper cites.
Symmetry, Representations, and Invariants
Roe Goodman and Nolan R. Wallach · 2009
Earlier work this paper cites.
Representation Theory of the Symmetric Groups
Tullio Ceccherini-Silberstein, Fabio Scarabotti, and Filippo Tolli · 2009
Earlier work this paper cites.
Markov chains and mixing times
David Asher Levin, Y. Peres, and Elizabeth L. Wilmer · 2009
Earlier work this paper cites.
The detectability lemma and quantum gap amplification
Dorit Aharonov, Itai Arad, Zeph Landau, and Umesh Vazirani · 2009
Cited alongside, same era.
The decoupling approach to quantum information theory, 2010
Frédéric Dupuis · 2010
Cited alongside, same era.
Comment on “random quantum circuits are approximate 2-designs” by a.w. harrow and r.a. low (commun. math. phys. 291, 257–302 (2009))
Igor Tuche Diniz and Daniel Jonathan · 2011
Cited alongside, same era.
Short random circuits define good quantum error correcting codes
Winton Brown and Omar Fawzi · 2013
Cited alongside, same era.
Towards the fast scrambling conjecture
Nima Lashkari, Douglas Stanford, Matthew Hastings, Tobias Osborne, and Patrick Hayden · 2013
Cited alongside, same era.
Decoupling with unitary approximate two-designs
Oleg Szehr, Frédéric Dupuis, Marco Tomamichel, and Renato Renner · 2013
Continuous symmetries and approximate quantum error correction
Philippe Faist, Sepehr Nezami, Victor V. Albert, Grant Salton, Fernando Pastawski, Patrick Hayden, and John Preskill · 2020
Later among the works it cites.
Predicting many properties of a quantum system from very few measurements
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2020
Later among the works it cites.
Quantum circuits for exact unitary t t -designs and applications to higher-order randomized benchmarking
Yoshifumi Nakata, Da Zhao, Takayuki Okuda, Eiichi Bannai, Yasunari Suzuki, Shiro Tamiya, Kentaro Heya, Zhiguang Yan, Kun Zuo, Shuhei Tamate, Yutaka Tabuchi, and Yasunobu Nakamura · 2021
Later among the works it cites.
Models of quantum complexity growth
Fernando G.S.L. Brandão, Wissam Chemissany, Nicholas Hunter-Jones, Richard Kueng, and John Preskill · 2021
Later among the works it cites.
Qudit circuits with SU(d) symmetry: Locality imposes additional conservation laws
Iman Marvian, Hanqing Liu, and Austin Hulse · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
One-shot decoupling
Frédéric Dupuis, Mario Berta, Jürg Wullschleger, and Renato Renner · 2014
Cited alongside, same era.
How to efficiently select an arbitrary Clifford group element
Robert Koenig and John A. Smolin · 2014
Cited alongside, same era.
Decoupling with random quantum circuits
Winton Brown and Omar Fawzi · 2015
Cited alongside, same era.
Chaos in quantum channels
Pavan Hosur, Xiao-Liang Qi, Daniel A Roberts, and Beni Yoshida · 2016
Cited alongside, same era.
The Clifford group forms a unitary 3-design
Zak Webb · 2016
Cited alongside, same era.
The Clifford group fails gracefully to be a unitary 4-design
Huangjun Zhu, Richard Kueng, Markus Grassl, and David Gross · 2016
Cited alongside, same era.
Improved spectral gaps for random quantum circuits: Large local dimensions and all-to-all interactions
Jonas Haferkamp and Nicholas Hunter-Jones · 2021
Later among the works it cites.
Hadamard-free circuits expose the structure of the clifford group
Sergey Bravyi and Dmitri Maslov · 2021
Later among the works it cites.
Schur–Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
David Gross, Sepehr Nezami, and Michael Walter · 2021
Later among the works it cites.
The randomized measurement toolbox
Andreas Elben, Steven T. Flammia, Hsin-Yuan Huang, Richard Kueng, John Preskill, Benoît Vermersch, and Peter Zoller · 2022
Later among the works it cites.
Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
Linghang Kong and Zi-Wen Liu · 2022
Later among the works it cites.
Representation learning via quantum neural tangent kernels
Junyu Liu, Francesco Tacchino, Jennifer R. Glick, Liang Jiang, and Antonio Mezzacapo · 2022
Later among the works it cites.
Scrambling Dynamics and Out-of-Time Ordered Correlators in Quantum Many-Body Systems: a Tutorial
Shenglong Xu and Brian Swingle · 2022
Later among the works it cites.
Linear growth of quantum circuit complexity
Jonas Haferkamp, Philippe Faist, Naga BT Kothakonda, Jens Eisert, and Nicole Yunger Halpern · 2022
Later among the works it cites.
Complete Entropic Inequalities for Quantum Markov Chains
Li Gao and Cambyse Rouzé · 2022
Later among the works it cites.
Speeding up learning quantum states through group equivariant convolutional quantum ansätze
Han Zheng, Zimu Li, Junyu Liu, Sergii Strelchuk, and Risi Kondor · 2023
Later among the works it cites.
Analytic theory for the dynamics of wide quantum neural networks
Junyu Liu, Khadijeh Najafi, Kunal Sharma, Francesco Tacchino, Liang Jiang, and Antonio Mezzacapo · 2023
Later among the works it cites.
SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning
Zimu Li, Han Zheng, Yunfei Wang, Liang Jiang, Zi-Wen Liu, and Junyu Liu · 2023
Later among the works it cites.
Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates
Aram W Harrow and Saeed Mehraban · 2023
Later among the works it cites.
Unitary k-designs from random number-conserving quantum circuits
Sumner N. Hearth, Michael O. Flynn, Anushya Chandran, and Chris R. Laumann · 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.
Quantum instruction set design for performance
Cupjin Huang, Tenghui Wang, Feng Wu, Dawei Ding, Qi Ye, Linghang Kong, Fang Zhang, Xiaotong Ni, Zhijun Song, Yaoyun Shi, Hui-Hai Zhao, Chunqing Deng, and Jianxin Chen · 2023
Later among the works it cites.
Incompressibility and spectral gaps of random circuits
Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp, Yunchao Liu, Tony Metger, and Xinyu Tan · 2024
Closest in time.
Shallow shadows: Expectation estimation using low-depth random clifford circuits
Christian Bertoni, Jonas Haferkamp, Marcel Hinsche, Marios Ioannou, Jens Eisert, and Hakop Pashayan · 2024
Closest in time.
Third moments of qudit clifford orbits and 3-designs based on magic orbits, 2024
Huangjun Zhu, Chengsi Mao, and Changhao Yi · 2024
Closest in time.
The computational power of random quantum circuits in arbitrary geometries, 2024
Matthew DeCross, Reza Haghshenas, Minzhao Liu, Enrico Rinaldi, Johnnie Gray, Yuri Alexeev, Charles H. Baldwin, John P. Bartolotta, Matthew Bohn, Eli Chertkov, Julia Cline, Jonhas Colina, Davide DelVento, Joan M. Dreiling, Cameron Foltz, John P. Gaebler, Thomas M. Gatterman, Christopher N. Gilbreth, Joshua Giles, Dan Gresh, Alex Hall, Aaron Hankin, Azure Hansen, Nathan Hewitt, Ian Hoffman, Craig Holliman, Ross B. Hutson, Trent Jacobs, Jacob Johansen, Patricia J. Lee, Elliot Lehman, Dominic Lucchetti, Danylo Lykov, Ivaylo S. Madjarov, Brian Mathewson, Karl Mayer, Michael Mills, Pradeep Niroula, Juan M. Pino, Conrad Roman, Michael Schecter, Peter E. Siegfried, Bruce G. Tiemann, Curtis Volin, James Walker, Ruslan Shaydulin, Marco Pistoia, Steven. A. Moses, David Hayes, Brian Neyenhuis, Russell P. Stutz, and Michael Foss-Feig · 2024
Closest in time.
A framework for semi-universality: Semi-universality of 3-qudit SU(d)-invariant gates
Austin Hulse, Hanqing Liu, and Iman Marvian · 2024
Closest in time.
Unitary Designs from Random Symmetric Quantum Circuits
Austin Hulse, Hanqing Liu, and Iman Marvian · 2024
Closest in time.
Efficient approximate unitary designs from random pauli rotations, 2024
Jeongwan Haah, Yunchao Liu, and Xinyu Tan · 2024
Closest in time.
Simple constructions of linear-depth t-designs and pseudorandom unitaries
Tony Metger, Alexander Poremba, Makrand Sinha, and Henry Yuen · 2024
Closest in time.
Unitary designs of symmetric local random circuits, 2024
Yosuke Mitsuhashi, Ryotaro Suzuki, Tomohiro Soejima, and Nobuyuki Yoshioka · 2024
Closest in time.
Random unitaries in extremely low depth, 2024
Thomas Schuster, Jonas Haferkamp, and Hsin-Yuan Huang · 2024
Closest in time.