Searcharxiv⌕ Search

arXiv subjects

John M. Martinis

Publications and source records attributed to John M. Martinis.

At least 55 records · Page 3Linked to original sources
arXiv2015

Universal quantum simulation with pre-threshold superconducting qubits: Single-excitation subspace method

We propose a method for general-purpose quantum computation and simulation that is well suited for today's pre-threshold-fidelity superconducting qubits. This approach makes use of the $n$-dimensional single-excitation subspace (SES) of a system of $n$ tunably coupled qubits. It can be viewed as a nonscalable special case of the standard gate-based quantum computing model, but allows many operations in the unitary group SU($n$) to be implemented by a single application of the Hamiltonian. Our approach bypasses the need to decompose the evolution operator into elementary gates, making large, nontrivial computations possible without error correction. The method is especially well suited for universal quantum simulation, specifically simulation of the Schrödinger equation with a real but otherwise arbitrary $n \times n$ Hamiltonian. We argue that a 1000-qubit SES processor, which would require no known improvements in superconducting device technology and which could be built today, should be capable of achieving quantum speedup relative to a petaflop supercomputer. We speculate on the utility and practicality of such a universal quantum simulator.

quant-ph↗
arXiv2015

Universal quantum simulation with prethreshold superconducting qubits: Single-excitation subspace method

Current quantum computing architectures lack the size and fidelity required for universal fault-tolerant operation, limiting the practical implementation of key quantum algorithms to all but the smallest problem sizes. In this work we propose an alternative method for general-purpose quantum computation that is ideally suited for such "prethreshold" superconducting hardware. Computations are performed in the n-dimensional single-excitation subspace (SES) of a system of n tunably coupled superconducting qubits. The approach is not scalable, but allows many operations in the unitary group SU(n) to be implemented by a single application of the Hamiltonian, bypassing the need to decompose a desired unitary into elementary gates. This feature makes large, nontrivial quantum computations possible within the available coherence time. We show how to use a programmable SES chip to perform fast amplitude amplification and phase estimation, two versatile quantum subalgorithms. We also show that an SES processor is well suited for Hamiltonian simulation, specifically simulation of the Schrodinger equation with a real but otherwise arbitrary nxn Hamiltonian matrix. We discuss the utility and practicality of such a universal quantum simulator, and propose its application to the study of realistic atomic and molecular collisions.

quant-ph↗
arXiv2015

Quantum theory of a bandpass Purcell filter for qubit readout

The readout fidelity of superconducting transmon and Xmon qubits is partially limited by the qubit energy relaxation through the resonator into the transmission line, which is also known as the Purcell effect. One way to suppress this energy relaxation is to employ a filter which impedes microwave propagation at the qubit frequency. We present semiclassical and quantum analyses for the bandpass Purcell filter realized by E.\ Jeffrey \textit{et al}.\ [Phys.\ Rev.\ Lett.\ 112, 190504 (2014)]. For typical experimental parameters, the bandpass filter suppresses the qubit relaxation rate by up to two orders of magnitude while maintaining the same measurement rate. We also show that in the presence of a microwave drive the qubit relaxation rate further decreases with increasing drive strength.

quant-ph↗
arXiv2015

Qubit metrology of ultralow phase noise using randomized benchmarking

A precise measurement of dephasing over a range of timescales is critical for improving quantum gates beyond the error correction threshold. We present a metrological tool, based on randomized benchmarking, capable of greatly increasing the precision of Ramsey and spin echo sequences by the repeated but incoherent addition of phase noise. We find our SQUID-based qubit is not limited by $1/f$ flux noise at short timescales, but instead observe a telegraph noise mechanism that is not amenable to study with standard measurement techniques.

quant-ph↗
arXiv2015

Traveling wave parametric amplifier with Josephson junctions using minimal resonator phase matching

Josephson parametric amplifiers have become a critical tool in superconducting device physics due to their high gain and quantum-limited noise. Traveling wave parametric amplifiers (TWPAs) promise similar noise performance while allowing for significant increases in both bandwidth and dynamic range. We present a TWPA device based on an LC-ladder transmission line of Josephson junctions and parallel plate capacitors using low-loss amorphous silicon dielectric. Crucially, we have inserted $λ/4$ resonators at regular intervals along the transmission line in order to maintain the phase matching condition between pump, signal, and idler and increase gain. We achieve an average gain of 12\,dB across a 4\,GHz span, along with an average saturation power of -92\,dBm with noise approaching the quantum limit.

cond-mat.supr-con↗
arXiv2015

Digital quantum simulation of fermionic models with a superconducting circuit

Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting due to their particle statistics, and Feynman left as an open question whether it could be done, because of the need for non-local control. Here, we implement fermionic interactions with digital techniques in a superconducting circuit. Focusing on the Hubbard model, we perform time evolution with constant interactions as well as a dynamic phase transition with up to four fermionic modes encoded in four qubits. The implemented digital approach is universal and allows for the efficient simulation of fermions in arbitrary spatial dimensions. We use in excess of 300 single-qubit and two-qubit gates, and reach global fidelities which are limited by gate errors. This demonstration highlights the feasibility of the digital approach and opens a viable route towards analog-digital quantum simulation of interacting fermions and bosons in large-scale solid state systems.

quant-ph↗
arXiv2014

State preservation by repetitive error detection in a superconducting quantum circuit

Quantum computing becomes viable when a quantum state can be preserved from environmentally-induced error. If quantum bits (qubits) are sufficiently reliable, errors are sparse and quantum error correction (QEC) is capable of identifying and correcting them. Adding more qubits improves the preservation by guaranteeing increasingly larger clusters of errors will not cause logical failure - a key requirement for large-scale systems. Using QEC to extend the qubit lifetime remains one of the outstanding experimental challenges in quantum computing. Here, we report the protection of classical states from environmental bit-flip errors and demonstrate the suppression of these errors with increasing system size. We use a linear array of nine qubits, which is a natural precursor of the two-dimensional surface code QEC scheme, and track errors as they occur by repeatedly performing projective quantum non-demolition (QND) parity measurements. Relative to a single physical qubit, we reduce the failure rate in retrieving an input state by a factor of 2.7 for five qubits and a factor of 8.5 for nine qubits after eight cycles. Additionally, we tomographically verify preservation of the non-classical Greenberger-Horne-Zeilinger (GHZ) state. The successful suppression of environmentally-induced errors strongly motivates further research into the many exciting challenges associated with building a large-scale superconducting quantum computer.

quant-ph↗
arXiv2014

UCSB final report for the CSQ program: Review of decoherence and materials physics for superconducting qubits

We review progress at UCSB on understanding the physics of decoherence in superconducting qubits. Although many decoherence mechanisms were studied and fixed in the last 5 years, the most important ones are two-level state defects in amorphous dielectrics, non-equilibrium quasiparticles generated from stray infrared light, and radiation to slotline modes. With improved design, the performance of integrated circuit transmons using the Xmon design are now close to world record performance: these devices have the advantage of retaining coherence when scaled up to 9 qubits.

quant-ph↗
arXiv2014

Characterization and reduction of microfabrication-induced decoherence in superconducting quantum circuits

Many superconducting qubits are highly sensitive to dielectric loss, making the fabrication of coherent quantum circuits challenging. To elucidate this issue, we characterize the interfaces and surfaces of superconducting coplanar waveguide resonators and study the associated microwave loss. We show that contamination induced by traditional qubit lift-off processing is particularly detrimental to quality factors without proper substrate cleaning, while roughness plays at most a small role. Aggressive surface treatment is shown to damage the crystalline substrate and degrade resonator quality. We also introduce methods to characterize and remove ultra-thin resist residue, providing a way to quantify and minimize remnant sources of loss on device surfaces.

cond-mat.mes-hall↗
arXiv2014

Fast adiabatic qubit gates using only $σ_z$ control

A controlled-phase gate was demonstrated in superconducting Xmon transmon qubits with fidelity reaching 99.4%, relying on the adiabatic interaction between the |11> and |02> states. Here we explain the theoretical concepts behind this protocol that achieves fast gate times with only $σ_z$ control of the Hamiltonian, based on a theory of non-linear mapping of state errors to a power spectral density and use of optimal window functions. With a solution given in the Fourier basis, optimization is shown to be straightforward for practical cases of an arbitrary state change and finite bandwidth of control signals. We find that errors below $10^{-4}$ are readily achievable for realistic control waveforms.

quant-ph↗
arXiv2014

Compressed sensing quantum process tomography for superconducting quantum gates

We apply the method of compressed sensing (CS) quantum process tomography (QPT) to characterize quantum gates based on superconducting Xmon and phase qubits. Using experimental data for a two-qubit controlled-Z gate, we obtain an estimate for the process matrix $χ$ with reasonably high fidelity compared to full QPT, but using a significantly reduced set of initial states and measurement configurations. We show that the CS method still works when the amount of used data is so small that the standard QPT would have an underdetermined system of equations. We also apply the CS method to the analysis of the three-qubit Toffoli gate with numerically added noise, and similarly show that the method works well for a substantially reduced set of data. For the CS calculations we use two different bases in which the process matrix $χ$ is approximately sparse, and show that the resulting estimates of the process matrices match each ther with reasonably high fidelity. For both two-qubit and three-qubit gates, we characterize the quantum process by not only its process matrix and fidelity, but also by the corresponding standard deviation, defined via variation of the state fidelity for different initial states.

quant-ph↗
arXiv2014

Rolling quantum dice with a superconducting qubit

One of the key challenges in quantum information is coherently manipulating the quantum state. However, it is an outstanding question whether control can be realized with low error. Only gates from the Clifford group -- containing $π$, $π/2$, and Hadamard gates -- have been characterized with high accuracy. Here, we show how the Platonic solids enable implementing and characterizing larger gate sets. We find that all gates can be implemented with low error. The results fundamentally imply arbitrary manipulation of the quantum state can be realized with high precision, providing new practical possibilities for designing efficient quantum algorithms.

quant-ph↗
arXiv2014

Tunable coupler for superconducting Xmon qubits: Perturbative nonlinear model

We study a recently demonstrated design for a high-performance tunable coupler suitable for superconducting Xmon and planar transmon qubits [Y. Chen et al., arXiv:1402.7367]. The coupler circuit uses a single flux-biased Josephson junction and acts as a tunable current divider. We calculate the effective qubit-qubit interaction Hamiltonian by treating the nonlinearity of the qubit and coupler junctions perturbatively. We find that the qubit nonlinearity has two principal effects: The first is to suppress the magnitude of the transverse XX coupling from that obtained in the harmonic approximation by about 15%. The second is to induce a small diagonal ZZ coupling. The effects of the coupler junction nonlinearity are negligible in the parameter regime considered.

quant-ph↗
arXiv2014

Scalable extraction of error models from the output of error detection circuits

Accurate methods of assessing the performance of quantum gates are extremely important. Quantum process tomography and randomized benchmarking are the current favored methods. Quantum process tomography gives detailed information, but significant approximations must be made to reduce this information to a form quantum error correction simulations can use. Randomized benchmarking typically outputs just a single number, the fidelity, giving no information on the structure of errors during the gate. Neither method is optimized to assess gate performance within an error detection circuit, where gates will be actually used in a large-scale quantum computer. Specifically, the important issues of error composition and error propagation lie outside the scope of both methods. We present a fast, simple, and scalable method of obtaining exactly the information required to perform effective quantum error correction from the output of continuously running error detection circuits, enabling accurate prediction of large-scale behavior.

quant-ph↗
arXiv2014

Simulating weak localization using superconducting quantum circuits

Understanding complex quantum matter presents a central challenge in condensed matter physics. The difficulty lies in the exponential scaling of the Hilbert space with the system size, making solutions intractable for both analytical and conventional numerical methods. As originally envisioned by Richard Feynman, this class of problems can be tackled using controllable quantum simulators. Despite many efforts, building an quantum emulator capable of solving generic quantum problems remains an outstanding challenge, as this involves controlling a large number of quantum elements. Here, employing a multi-element superconducting quantum circuit and manipulating a single microwave photon, we demonstrate that we can simulate the weak localization phenomenon observed in mesoscopic systems. By engineering the control sequence in our emulator circuit, we are also able to reproduce the well-known temperature dependence of weak localization. Furthermore, we can use our circuit to continuously tune the level of disorder, a parameter that is not readily accessible in mesoscopic systems. By demonstrating a high level of control and complexity, our experiment shows the potential for superconducting quantum circuits to realize scalable quantum simulators.

cond-mat.supr-con↗
arXiv2014

Quantifying the effects of local many-qubit errors and non-local two-qubit errors on the surface code

Topological quantum error correction codes are known to be able to tolerate arbitrary local errors given sufficient qubits. This includes correlated errors involving many local qubits. In this work, we quantify this level of tolerance, numerically studying the effects of many-qubit errors on the performance of the surface code. We find that if increasingly large area errors are at least moderately exponentially suppressed, arbitrarily reliable quantum computation can still be achieved with practical overhead. We furthermore quantify the effect of non-local two-qubit correlated errors, which would be expected in arrays of qubits coupled by a polynomially decaying interaction, and when using many-qubit coupling devices. We surprisingly find that the surface code is very robust to this class of errors, despite a provable lack of a threshold error rate when such errors are present.

quant-ph↗
arXiv2014

Optimal quantum control using randomized benchmarking

We present a method for optimizing quantum control in experimental systems, using a subset of randomized benchmarking measurements to rapidly infer error. This is demonstrated to improve single- and two-qubit gates, minimize gate bleedthrough, where a gate mechanism can cause errors on subsequent gates, and identify control crosstalk in superconducting qubits. This method is able to correct parameters to where control errors no longer dominate, and is suitable for automated and closed-loop optimization of experimental systems.

quant-ph↗