Quantum supremacy using a programmable superconducting processor
- F. Arute, K. Arya, J. Martinis
- Physics, Computer ScienceNature
- 23 October 2019
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
The application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA) is demonstrated and an approximation ratio is obtained that is independent of problem size and for the first time, that performance increases with circuit depth.
Hartree-Fock on a superconducting qubit quantum computer
- F. Arute, K. Arya, Adam Zalcman
- PhysicsScience
- 8 April 2020
Several quantum simulations of chemistry with up to one dozen qubits are performed, including modeling the isomerization mechanism of diazene, and error-mitigation strategies based on N-representability that dramatically improve the effective fidelity of the experiments are demonstrated.
Demonstrating a Continuous Set of Two-Qubit Gates for Near-Term Quantum Algorithms.
- B. Foxen, C. Neill, J. Martinis
- PhysicsPhysical Review Letters
- 23 January 2020
This work implements two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ that can provide a threefold reduction in circuit depth as compared to a standard decomposition.
Realizing topologically ordered states on a quantum processor
- K. Satzinger, Y.-J Liu, P. Roushan
- PhysicsScience
- 2 April 2021
The results demonstrate the potential for quantum processors to provide insights into topological quantum matter and quantum error correction and investigated key aspects of the surface code, including logical state injection and the decay of the nonlocal order parameter.
Diabatic Gates for Frequency-Tunable Superconducting Qubits.
- R. Barends, C. Quintana, J. Martinis
- PhysicsPhysical Review Letters
- 4 July 2019
Diabatic two-qubit gates with Pauli error rates down to 4.3(2)×10^{-3} in as fast as 18 ns using frequency-tunable superconducting qubits are demonstrated by synchronizing the entangling parameters with minima in the leakage channel.
Information Scrambling in Computationally Complex Quantum Circuits
- X. Mi, P. Roushan, Yu Chen
- Biology
- 21 January 2021
This paper presents a meta-anatomy of the response of the immune system to the presence of Tau, a type of virus that attacks the nervous system through a variety of mechanisms, including “cell reprograming” and “spatially aggregating”.
Growth and preservation of entanglement in a many-body localized system
- B. Chiaro, C. Neill, P. Roushan
- Physics
- 14 October 2019
In non-interacting systems disorder leads to Anderson localization, where particle diffusion and entanglement propagation are absent. Interactions between the constituent particles modify this…
Exponential suppression of bit or phase errors with cyclic error correction
- Zijun Chen, K. Satzinger, J. Kelly
- PhysicsNature
- 11 February 2021
One-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits are implemented that demonstrate exponential suppression of bit-flip or phase-Flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21.
Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
Strongly correlated quantum systems give rise to many exotic physical phenomena, including high-temperature superconductivity. Simulating these systems on quantum computers may avoid the…
...
...