Fetching the paper…
Reading the bibliography…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible).
“Coherence in Spontaneous Radiation Processes”
R.. Dicke · 1954
Earlier work this paper cites.
“Applied combinatorial mathematics”
Edwin. Beckenbach · 1964
Earlier work this paper cites.
“Rigorous results on valence-bond ground states in antiferromagnets”
Ian Affleck, Tom Kennedy, Elliott. Lieb and Hal Tasaki · 1987
Earlier work this paper cites.
“A Catalog of Complexity Classes”
David. Johnson · 1990
Earlier work this paper cites.
“A Fast Quantum Mechanical Algorithm for Database Search”
Lov. Grover · 1996
Earlier work this paper cites.
“Quantum computations: algorithms and error correction”
A Kitaev · 1997
Earlier work this paper cites.
“Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”
P.. Shor · 1997
Earlier work this paper cites.
“The Heisenberg Representation of Quantum Computers”
Daniel Gottesman · 1998
Earlier work this paper cites.
“Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations”
Daniel Gottesman and Isaac Chuang · 1999
Earlier work this paper cites.
“Quantum Circuits: Fanout, Parity, and Counting”
Cristopher Moore · 1999
Earlier work this paper cites.
“Introduction to circuit complexity: a uniform approach”
Heribert Vollmer · 1999
Earlier work this paper cites.
“Three qubits can be entangled in two inequivalent ways”
W. Dür, G. Vidal and J.. Cirac · 2000
Earlier work this paper cites.
“Grover algorithm with zero theoretical failure rate”
G.. Long · 2001
Earlier work this paper cites.
“A One-Way Quantum Computer”
Robert Raussendorf and Hans. Briegel · 2001
Earlier work this paper cites.
“Counting, fanout and the complexity of quantum ACC”
Frederic Green, Steven Homer, Cristopher Moore and Christopher Pollett · 2002
Earlier work this paper cites.
“Multilinear Formulas and Skepticism of Quantum Computing”
Scott Aaronson · 2004
Earlier work this paper cites.
“Scalable multiparticle entanglement of trapped ions”
H. Häffner et al · 2005
Earlier work this paper cites.
“Quantum Fan-out is Powerful”
Peter Høyer and Robert Špalek · 2005
Earlier work this paper cites.
“Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms”
Dave Bacon, Isaac. Chuang and Aram. Harrow · 2006
Earlier work this paper cites.
“An introduction to measurement based quantum computation”
Richard Jozsa · 2006
Earlier work this paper cites.
“Quantum versus Classical Proofs and Advice”
Scott Aaronson and Greg Kuperberg · 2007
Earlier work this paper cites.
“A necessary and sufficient condition to play games in quantum mechanical settings”
S Özdemir, J Shimamura and N Imoto · 2007
Earlier work this paper cites.
“Generalized Clifford groups and simulation of associated quantum circuits”
Sean Clark, Richard Jozsa and Noah Linden · 2008
Cited alongside, same era.
“Temporally unstructured quantum computation”
Dan. Shepherd and Michael. Bremner · 2008
Cited alongside, same era.
“On the Hardness of Detecting Macroscopic Superpositions”, 2020
Scott Aaronson, Yosi Atia and Leonard Susskind · 2009
Cited alongside, same era.
“Experimental Realization of Dicke States of up to Six Qubits for Multiparty Quantum Networking”
R. Prevedel et al · 2009
Cited alongside, same era.
“Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy”
Michael. Bremner, Richard Jozsa and Dan. Shepherd · 2010
Cited alongside, same era.
“Quantum Computation and Quantum Information”
Michael. Nielsen and Isaac. Chuang · 2010
“Weak ergodicity breaking from quantum many-body scars”
Christopher Turner et al · 2018
Later among the works it cites.
“Deterministic preparation of Dicke states”
Andreas Bärtschi and Stephan Eidenbenz · 2019
Later among the works it cites.
“From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz”
Stuart Hadfield et al · 2019
Later among the works it cites.
“Weak Ergodicity Breaking and Quantum Many-Body Scars in Spin-1 X Y XY Magnets”
Michael Schecter and Thomas Iadecola · 2019
Later among the works it cites.
Adam Watts, Robin Kothari, Luke Schaeffer and Avishay Tal · 2019
Later among the works it cites.
“The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Generation of three-qubit entangled states using superconducting phase qubits”
Matthew Neeley et al · 2010
Cited alongside, same era.
“Efficient compression of quantum information”
Martin Plesch and Vladimı́r Bužek · 2010
Cited alongside, same era.
“Simplified derivation of the Bethe-ansatz equations for the Dicke model”
Oleksandr Tsyplyatyev, Jan von Delft and Daniel Loss · 2010
Cited alongside, same era.
“Computational Depth Complexity of Measurement-Based Quantum Computation”
Dan Browne, Elham Kashefi and Simon Perdrix · 2011
Cited alongside, same era.
“Multipartite entanglement and high-precision metrology”
Géza Tóth · 2012
Cited alongside, same era.
“Excited-state quantum phase transitions in Dicke superradiance models”
Tobias Brandes · 2013
Cited alongside, same era.
Jeremy Cook, Stephan Eidenbenz and Andreas Bärtschi · 2020
Later among the works it cites.
“Quantum many-body scar states with emergent kinetic constraints and finite-entanglement revivals”
Thomas Iadecola and Michael Schecter · 2020
Later among the works it cites.
“Large classes of quantum scarred Hamiltonians from matrix product states”
Sanjay Moudgalya et al · 2020
Later among the works it cites.
“Dicke Transition in Open Many-Body Systems Determined by Fluctuation Effects”
Alla. Bezvershenko et al · 2021
Later among the works it cites.
“Quantum Circuits Assisted by Local Operations and Classical Communication: Transformations and Phases of Matter”
Lorenzo Piroli, Georgios Styliaris and J. Cirac · 2021
Later among the works it cites.
“Preparing Bethe Ansatz Eigenstates on a Quantum Computer”
John. Van et al · 2021
Later among the works it cites.
“Short-Depth Circuits for Dicke State Preparation”
Andreas Bärtschi and Stephan Eidenbenz · 2022
Later among the works it cites.
“Benchmarking the performance of portfolio optimization with QAOA”
Sebastian Brandhofer et al · 2022
Later among the works it cites.
“Interactive Proofs for Synthesizing Quantum States and Unitaries”
Gregory Rosenthal and Henry. Yuen · 2022
Later among the works it cites.
“Experimentally accessible nonseparability criteria for multipartite-entanglement-structure detection”
Guillermo García-Pérez, Oskari Kerppo, Matteo.. Rossi and Sabrina Maniscalco · 2023
Closest in time.
“Preparing quantum many-body scar states on quantum computers”
Erik. Gustafson et al · 2023
Closest in time.
“stateQIP = statePSPACE”
Tony Metger and Henry Yuen · 2023
Closest in time.
“Deterministic Constant-Depth Preparation of the AKLT State on a Quantum Processor Using Fusion Measurements”
Kevin. Smith, Eleanor Crane, Nathan Wiebe and S.M. Girvin · 2023
Closest in time.
“Shortest Route to Non-Abelian Topological Order on a Quantum Processor”
Nathanan Tantivasadakarn, Ruben Verresen and Ashvin Vishwanath · 2023
Closest in time.
“Hierarchy of Topological Order From Finite-Depth Unitaries, Measurement, and Feedforward”
Nathanan Tantivasadakarn, Ashvin Vishwanath and Ruben Verresen · 2023
Closest in time.
“Long-Range Entanglement from Measuring Symmetry-Protected Topological Phases”
Nathanan Tantivasadakarn, Ryan Thorngren, Ashvin Vishwanath and Ruben Verresen · 2024
Closest in time.