Fetching the paper…
Reading the bibliography…
This is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature.
Bootstrap methods: Another look at the jackknife
Efron, B · 1979
Earlier work this paper cites.
Quantum limits on noise in linear amplifiers
Caves, C. M · 1982
Earlier work this paper cites.
Random quantum states
Wootters, W. K · 1990
Earlier work this paper cites.
Two-bit gates are universal for quantum computation
DiVincenzo, D. P · 1995
Earlier work this paper cites.
Scheme for reducing decoherence in quantum computer memory
Shor, P. W · 1995
Earlier work this paper cites.
On universal and fault-tolerant quantum computing
Boykin, P., Mor, T., Pulver, M., Roychowdhury, V. & Vatan, F · 1999
Earlier work this paper cites.
Cavity quantum electrodynamics for superconducting electrical circuits: An architecture for quantum computation
Blais, A., Huang, R.-S., Wallraff, A., Girvin, S. M. & Schoelkopf, R. J · 2004
Earlier work this paper cites.
Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics
Wallraff, A · 2004
Earlier work this paper cites.
A complete anytime algorithm for treewidth
Gogate, V. & Dechter, R · 2004
Earlier work this paper cites.
Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
Terhal, B. M. & DiVincenzo, D. P · 2004
Earlier work this paper cites.
An introduction to Cartan’s KAK decomposition for QC programmers
Tucci, R. R · 2005
Earlier work this paper cites.
Convergence conditions for random quantum circuits
Emerson, J., Livine, E. & Lloyd, S · 2005
Earlier work this paper cites.
The concentration of measure phenomenon
Ledoux, M · 2005
Earlier work this paper cites.
Testing Statistical Hypotheses (Springer-Verlag New York, 2005)
Lehmann, E. L. & Romano, J. P · 2005
Earlier work this paper cites.
Qubit-photon interactions in a cavity: Measurement-induced dephasing and number splitting
Gambetta, J · 2006
Earlier work this paper cites.
Entanglement and the foundations of statistical mechanics
Popescu, S., Short, A. J. & Winter, A · 2006
Earlier work this paper cites.
Massively parallel quantum computer simulator
De Raedt, K · 2007
Earlier work this paper cites.
Randomized benchmarking of quantum gates
Knill, E · 2008
Earlier work this paper cites.
Simulating quantum computation by contracting tensor networks
Markov, I. L. & Shi, Y · 2008
Earlier work this paper cites.
Are random pure states useful for quantum computation?
Bremner, M. J., Mora, C. & Winter, A · 2009
Earlier work this paper cites.
Most quantum states are too entangled to be useful as computational resources
Gross, D., Flammia, S. T. & Eisert, J · 2009
Earlier work this paper cites.
Demonstration of two-qubit algorithms with a superconducting quantum processor
DiCarlo, L · 2009
Earlier work this paper cites.
Computational complexity: a modern approach (Cambridge University Press, 2009)
Arora, S. & Barak, B · 2009
Earlier work this paper cites.
The complexity of satisfiability of small depth circuits
Calabro, C., Impagliazzo, R. & Paturi, R · 2009
Earlier work this paper cites.
Introduction to quantum noise, measurement, and amplification
Clerk, A. A., Devoret, M. H., Girvin, S. M., Marquardt, F. & Schoelkopf, R. J · 2010
Earlier work this paper cites.
Fast reset and suppressing spontaneous emission of a superconducting qubit
Reed, M. D · 2010
Earlier work this paper cites.
Quantum process tomography of a universal entangling gate implemented with Josephson phase qubits
Bialczak, R. C · 2010
Earlier work this paper cites.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R. & Shepherd, D. J · 2010
Earlier work this paper cites.
Robust randomized benchmarking of quantum processes
Magesan, E., Gambetta, J. M. & Emerson, J · 2011
Earlier work this paper cites.
The computational complexity of linear optics
Aaronson, S. & Arkhipov, A · 2011
Earlier work this paper cites.
Multiplexed dispersive readout of superconducting phase qubits
Chen, Y · 2012
Earlier work this paper cites.
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M. & Emerson, J · 2012
Earlier work this paper cites.
Heralded state preparation in a superconducting qubit
Johnson, J. E · 2012
Earlier work this paper cites.
Quantum computing and the entanglement frontier
Preskill, J · 2012
Earlier work this paper cites.
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R · 2014
Cited alongside, same era.
Qubit architecture with high coherence and fast tunable coupling
Chen, Y · 2014
Cited alongside, same era.
Strong environmental coupling in a Josephson parametric amplifier
Mutus, J. Y · 2014
Cited alongside, same era.
Fast accurate state measurement with superconducting qubits
Jeffrey, E · 2014
Cited alongside, same era.
Optimal quantum control using randomized benchmarking
Kelly, J · 2014
Cited alongside, same era.
Fast adiabatic qubit gates using only
Martinis, J. M. & Geller, M. R · 2014
Cited alongside, same era.
High speed flux sampling for tunable superconducting qubits with an embedded cryogenic transducer
Foxen, B · 2018
Later among the works it cites.
General method for extracting the quantum efficiency of dispersive qubit readout in circuit QED
Bultink, C. C · 2018
Later among the works it cites.
Characterizing quantum supremacy in near-term devices
Boixo, S · 2018
Later among the works it cites.
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R. & Neven, H · 2018
Later among the works it cites.
Markov, I. L., Fatima, A., Isakov, S. V. & Boixo, S · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast, accurate state measurement in superconducting qubits
Sank, D. T · 2014
Cited alongside, same era.
Gaussian noise sensitivity and bosonsampling
Kalai, G. & Kindler, G · 2014
Cited alongside, same era.
The equivalence of sampling and searching
Aaronson, S · 2014
Cited alongside, same era.
Qubit measurement error from coupling with a detuned neighbor in circuit QED
Khezri, M., Dressel, J. & Korotkov, A. N · 2015
Cited alongside, same era.
Tomography via correlation of noisy measurement records
Ryan, C. A · 2015
Cited alongside, same era.
What is the connection between analog signal to noise ratio and signal to noise ratio in the IQ plane in a quadrature demodulation system?
Sank, D · 2015
Cited alongside, same era.
Chen, Z · 2018
Later among the works it cites.
Fluctuations of energy-relaxation times in superconducting qubits
Klimov, P. V · 2018
Later among the works it cites.
Quantum simulation of electronic structure with linear depth and connectivity
Kivlichan, I. D · 2018
Later among the works it cites.
Low-depth quantum simulation of materials
Babbush, R · 2018
Later among the works it cites.
Chen, J · 2018
Later among the works it cites.
Jureca: Modular supercomputer at Jülich supercomputing centre
Krause, D. & Thörnig, P · 2018
Later among the works it cites.
Operator spreading in random unitary circuits
Nahum, A., Vijay, S. & Haah, J · 2018
Later among the works it cites.
Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
Von Keyserlingk, C., Rakovszky, T., Pollmann, F. & Sondhi, S. L · 2018
Later among the works it cites.
Harrow, A. W. & Mehraban, S · 2018
Later among the works it cites.
Huang, C., Newman, M. & Szegedy, M · 2018
Later among the works it cites.
Dalzell, A. M., Harrow, A. W., Koh, D. E. & La Placa, R. L · 2018
Later among the works it cites.
Quantum supremacy using a programmable superconducting processor
Arute, F · 2019
Closest in time.
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D. & Gambetta, J. M · 2019
Closest in time.
Kelly, J., O’Malley, P., Neeley, M., Neven, H. & Martinis, J. M · 2019
Closest in time.
A flexible high-performance simulator for the verification and benchmarking of quantum circuits implemented on real hardware
Villalonga, B · 2019
Closest in time.
Erhard, A · 2019
Closest in time.
The case against quantum computing
Dyakonov, M · 2019
Closest in time.
The argument against quantum computers. Preprint at https://arxiv.org/pdf/1908.02499 (2019)
Kalai, G · 2019
Closest in time.
Villalonga, B · 2019
Closest in time.
Tensor algebra library routines for shared memory systems
Lyakh, D · 2019
Closest in time.
Guo, C · 2019
Closest in time.
Massively parallel quantum computer simulator, eleven years later
De Raedt, H · 2019
Closest in time.
Juwels: Modular tier-0/1 supercomputer at the Jülich supercomputing centre
Krause, D · 2019
Closest in time.
Zhang, F · 2019
Closest in time.
Chen, M.-C · 2019
Closest in time.
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C. & Vazirani, U · 2019
Closest in time.
Cayley path and quantum computational supremacy: A proof of average-case
Movassagh, R · 2019
Closest in time.
Morimae, T. & Tamaki, S · 2019
Closest in time.
Certifiable randomness from supremacy
Aaronson, S · 2019
Closest in time.