Share This Author
Quantum supremacy using a programmable superconducting processor
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.
Surface codes: Towards practical large-scale quantum computation
The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.
Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of…
Quantum ground state and single-phonon control of a mechanical resonator
This work shows that conventional cryogenic refrigeration can be used to cool a mechanical mode to its quantum ground state by using a microwave-frequency mechanical oscillator—a ‘quantum drum’—coupled to a quantum bit, which is used to measure the quantum state of the resonator.
Scalable Quantum Simulation of Molecular Energies
We report the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation. We use a programmable array of superconducting qubits to compute the…
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.
What is the Computational Value of Finite Range Tunneling
It is demonstrated how finite range tunneling can provide considerable computational advantage over classical processors for a crafted problem designed to have tall and narrow energy barriers separating local minima, the D-Wave 2X quantum annealer achieves significant runtime advantages relative to Simulated Annealing.
Decoherence in Josephson qubits from dielectric loss.
With a redesigned phase qubit employing low-loss dielectrics, the energy relaxation rate has been improved by a factor of 20, opening up the possibility of multiqubit gates and algorithms.
Superconducting quantum circuits at the surface code threshold for fault tolerance
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
Defining and detecting quantum speedup
Here, it is shown how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup, and the subtle nature of the quantum speed up question is illustrated.