arXiv subjects

Seth T. Merkel

Publications and source records attributed to Seth T. Merkel.

At least 19 recordsLinked to original sources

arXiv2023

Benchmarking Quantum Processor Performance at Scale

As quantum processors grow, new performance benchmarks are required to capture the full quality of the devices at scale. While quantum volume is an excellent benchmark, it focuses on the highest quality subset of the device and so is unable to indicate the average performance over a large number of connected qubits. Furthermore, it is a discrete pass/fail and so is not reflective of continuous improvements in hardware nor does it provide quantitative direction to large-scale algorithms. For example, there may be value in error mitigated Hamiltonian simulation at scale with devices unable to pass strict quantum volume tests. Here we discuss a scalable benchmark which measures the fidelity of a connecting set of two-qubit gates over $N$ qubits by measuring gate errors using simultaneous direct randomized benchmarking in disjoint layers. Our layer fidelity can be easily related to algorithmic run time, via $\gamma$ defined in Ref.\cite{berg2022probabilistic} that can be used to estimate the number of circuits required for error mitigation. The protocol is efficient and obtains all the pair rates in the layered structure. Compared to regular (isolated) RB this approach is sensitive to crosstalk. As an example we measure a $N=80~(100)$ qubit layer fidelity on a 127 qubit fixed-coupling "Eagle" processor (ibm\_sherbrooke) of 0.26(0.19) and on the 133 qubit tunable-coupling "Heron" processor (ibm\_montecarlo) of 0.61(0.26). This can easily be expressed as a layer size independent quantity, error per layered gate (EPLG), which is here $1.7\times10^{-2}(1.7\times10^{-2})$ for ibm\_sherbrooke and $6.2\times10^{-3}(1.2\times10^{-2})$ for ibm\_montecarlo.

quant-ph↗

arXiv2023

Encoding a magic state with beyond break-even fidelity

To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from noise~\cite{Harper2019,Ryan-Anderson2021,Egan2021fault, Chen2022calibrated, Sundaresan2022matching, ryananderson2022implementing, Postler2022demonstration, GoogleAI2023}. We can complete a universal set of logic gates by producing special resources called magic states~\cite{Bravyi2005universal,Maier2013magic, Chamberland2022building}. It is therefore important to produce high-fidelity magic states to conduct algorithms while introducing a minimal amount of noise to the computation. Here, we propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those we can prepare using the individual qubits of the device. This demonstrates a fundamental principle of fault-tolerant quantum computing~\cite{Shor96}, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Additionally, we show we can increase the yield of magic states using adaptive circuits, where circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability we will need for many error-correction subroutines. Our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.

quant-ph↗

arXiv2021

Experimental accreditation of outputs of noisy quantum computers

We provide and experimentally demonstrate an accreditation protocol that upper-bounds the variation distance between noisy and noiseless probability distributions of the outputs of arbitrary quantum computations. We accredit the outputs of twenty-four quantum circuits executed on programmable superconducting hardware, ranging from depth nine circuits on ten qubits to depth twenty-one circuits on four qubits. Our protocol requires implementing the "target" quantum circuit along with a number of random Clifford circuits and subsequently post-processing the outputs of these Clifford circuits. Importantly, the number of Clifford circuits is chosen to obtain the bound with the desired confidence and accuracy, and is independent of the size and nature of the target circuit. We thus demonstrate a practical and scalable method of ascertaining the correctness of the outputs of arbitrary-sized noisy quantum computers--the ultimate arbiter of the utility of the computer itself.

quant-ph↗

arXiv2021

Scalable error mitigation for noisy quantum circuits produces competitive expectation values

Noise in existing quantum processors only enables an approximation to ideal quantum computation. However, these approximations can be vastly improved by error mitigation, for the computation of expectation values, as shown by small-scale experimental demonstrations. However, the practical scaling of these methods to larger system sizes remains unknown. Here, we demonstrate the utility of zero-noise extrapolation for relevant quantum circuits using up to 26 qubits, circuit depths of 60, and 1080 CNOT gates. We study the scaling of the method for canonical examples of product states and entangling Clifford circuits of increasing size, and extend it to the quench dynamics of 2-D Ising spin lattices with varying couplings. We show that the efficacy of the error mitigation is greatly enhanced by additional error suppression techniques and native gate decomposition that reduce the circuit time. By combining these methods, we demonstrate an accuracy in the approximate quantum simulation of the quench dynamics that surpasses the classical approximations obtained from a state-of-the-art 2-D tensor network method. These results reveal a path to a relevant quantum advantage with noisy, digital, quantum processors.

quant-ph↗

arXiv2021

Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors

We show that the Randomized Benchmarking (RB) protocol is a convolution amenable to Fourier space analysis. By adopting the mathematical framework of Fourier transforms of matrix-valued functions on groups established in recent work from Gowers and Hatami [Sbornik: Mathematics 208, 1784 (2017)], we provide an alternative proof of Wallman's [Quantum 2, 47 (2018)] and Proctor's [Phys. Rev. Lett. 119, 130502 (2017)] bounds on the effect of gate-dependent noise on randomized benchmarking. We show explicitly that as long as our faulty gate-set is close to the targeted representation of the Clifford group, an RB sequence is described by the exponential decay of a process that has exactly two eigenvalues close to one and the rest close to zero. This framework also allows us to construct a gauge in which the average gate-set error is a depolarizing channel parameterized by the RB decay rates, as well as a gauge which maximizes the fidelity with respect to the ideal gate-set.

quant-ph↗

arXiv2017

Randomized Benchmarking, Correlated Noise, and Ising Models

We compute the expected randomized benchmarking sequence fidelity for a system subject to Gaussian time-correlated noise. For single qubit benchmarking we show that the expected sequence fidelity is given by the partition function of a long-range coupled spin-one Ising model, with each site in the Ising model corresponding to a free evolution interval. For d-state systems, the expected sequence fidelity is given by an Ising-like model partition function whose site variables are given by the weights of the adjoint representation of SU(d). A high effective temperature expansion for the partition function in the single qubit case shows decay of sequence fidelity varying from exponential for uncorrelated noise to a power law for quasistatic noise. Fitting an exponential to the sequence fidelity decay under correlated noise gives unreliable estimates of the average gate error rate.

quant-ph↗

arXiv2014

Efficient measurement of quantum gate error by interleaved randomized benchmarking

We describe a scalable experimental protocol for obtaining estimates of the error rate of individual quantum computational gates. This protocol, in which random Clifford gates are interleaved between a gate of interest, provides a bounded estimate of the average error of the gate under test so long as the average variation of the noise affecting the full set of Clifford gates is small. This technique takes into account both state preparation and measurement errors and is scalable in the number of qubits. We apply this protocol to a superconducting qubit system and find gate errors that compare favorably with the gate errors extracted via quantum process tomography.

quant-ph↗

arXiv2013

Microwave-activated conditional-phase gate for superconducting qubits

We introduce a new entangling gate between two fixed-frequency qubits statically coupled via a microwave resonator bus which combines the following desirable qualities: all-microwave control, appreciable qubit separation for reduction of crosstalk and leakage errors, and the ability to function as a two-qubit conditional-phase gate. A fixed, always-on interaction is explicitly designed between higher energy (non-computational) states of two transmon qubits, and then a conditional-phase gate is `activated' on the otherwise unperturbed qubit subspace via a microwave drive. We implement this microwave-activated conditional-phase gate with a fidelity from quantum process tomography of 87%.

quant-ph↗

arXiv2012

Entanglement of two superconducting qubits in a waveguide cavity via monochromatic two-photon excitation

We report a system where fixed interactions between non-computational levels make bright the otherwise forbidden two-photon 00 --> 11 transition. The system is formed by hand selection and assembly of two discrete component transmon-style superconducting qubits inside a rectangular microwave cavity. The application of a monochromatic drive tuned to this transition induces two-photon Rabi-like oscillations between the ground and doubly-excited states via the Bell basis. The system therefore allows all-microwave two-qubit universal control with the same techniques and hardware required for single qubit control. We report Ramsey-like and spin echo sequences with the generated Bell states, and measure a two-qubit gate fidelity of 90% (unconstrained) and 86% (maximum likelihood estimator).

quant-ph↗

arXiv2012

Self-Consistent Quantum Process Tomography

Quantum process tomography is a necessary tool for verifying quantum gates and diagnosing faults in architectures and gate design. We show that the standard approach of process tomography is grossly inaccurate in the case where the states and measurement operators used to interrogate the system are generated by gates that have some systematic error, a situation all but unavoidable in any practical setting. These errors in tomography can not be fully corrected through oversampling or by performing a larger set of experiments. We present an alternative method for tomography to reconstruct an entire library of gates in a self-consistent manner. The essential ingredient is to define a likelihood function that assumes nothing about the gates used for preparation and measurement. In order to make the resulting optimization tractable we linearize about the target, a reasonable approximation when benchmarking a quantum computer as opposed to probing a black-box function.

quant-ph↗

arXiv2012

Theory of Josephson Photomultipliers: Optimal Working Conditions and Back Action

We describe the back action of microwave-photon detection via a Josephson photomultiplier (JPM), a superconducting qubit coupled strongly to a high-quality microwave cavity. The back action operator depends qualitatively on the duration of the measurement interval, resembling the regular photon annihilation operator at short interaction times and approaching a variant of the photon subtraction operator at long times. The optimal operating conditions of the JPM differ from those considered optimal for processing and storing of quantum information, in that a short $T_2$ of the JPM suppresses the cavity dephasing incurred during measurement. Understanding this back action opens the possibility to perform multiple JPM measurements on the same state, hence performing efficient state tomography.

quant-ph↗

arXiv2012

Superconducting qubit in waveguide cavity with coherence time approaching 0.1ms

We report a superconducting artificial atom with an observed quantum coherence time of T2*=95us and energy relaxation time T1=70us. The system consists of a single Josephson junction transmon qubit embedded in an otherwise empty copper waveguide cavity whose lowest eigenmode is dispersively coupled to the qubit transition. We attribute the factor of four increase in the coherence quality factor relative to previous reports to device modifications aimed at reducing qubit dephasing from residual cavity photons. This simple device holds great promise as a robust and easily produced artificial quantum system whose intrinsic coherence properties are sufficient to allow tests of quantum error correction.

quant-ph↗

arXiv2012

Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits

We use quantum process tomography to characterize a full universal set of all-microwave gates on two superconducting single-frequency single-junction transmon qubits. All extracted gate fidelities, including those for Clifford group generators, single-qubit pi/4 and pi/8 rotations, and a two-qubit controlled-NOT, exceed 95% (98%), without (with) accounting for state preparation and measurement errors. Furthermore, we introduce a process map representation in the Pauli basis which is visually efficient and informative. This high-fidelity gate set serves as another critical building block towards scalable architectures of superconducting qubits for error correction schemes.

quant-ph↗

arXiv2011

High Fidelity Quantum Gates in the Presence of Dispersion

We numerically demonstrate the control of motional degrees of freedom of an ensemble of neutral atoms in an optical lattice with a shallow trapping potential. Taking into account the range of quasimomenta across different Brillouin zones results in an ensemble whose members effectively have inhomogeneous control fields as well as spectrally distinct control Hamiltonians. We present an ensemble-averaged optimal control technique that yields high fidelity control pulses, irrespective of quasimomentum, with average fidelities above 98%. The resulting controls show a broadband spectrum with gate times in the order of several free oscillations to optimize gates with up to 13.2% dispersion in the energies from the band structure. This can be seen as a model system for the prospects of robust quantum control. This result explores the limits of discretizing a continuous ensemble for control theory.

quant-ph↗

arXiv2011

Control of inhomogeneous atomic ensembles of hyperfine qudits

We study the ability to control d-dimensional quantum systems (qudits) encoded in the hyperfine spin of alkali-metal atoms through the application of radio- and microwave-frequency magnetic fields in the presence of inhomogeneities in amplitude and detuning. Such a capability is essential to the design of robust pulses that mitigate the effects of experimental uncertainty and also for application to tomographic addressing of particular members of an extended ensemble. We study the problem of preparing an arbitrary state in the Hilbert space from an initial fiducial state. We prove that inhomogeneous control of qudit ensembles is possible based on a semi-analytic protocol that synthesizes the target through a sequence of alternating rf and microwave-driven SU(2) rotations in overlapping irreducible subspaces. Several examples of robust control are studied, and the semi-analytic protocol is compared to a brute force, full numerical search. For small inhomogeneities, < 1%, both approaches achieve average fidelities greater than 0.99, but the brute force approach performs superiorly, reaching high fidelities in shorter times and capable of handling inhomogeneities well beyond experimental uncertainty. The full numerical search is also applied to tomographic addressing whereby two different nonclassical states of the spin are produced in two halves of the ensemble.

quant-ph↗

arXiv2010

Generation and detection of NOON states in superconducting circuits

NOON states, states between two modes of light of the form $|N,0\rangle+e^{iϕ}|0,N\rangle$ allow for super-resolution interformetry. We show how NOON states can be efficiently produced in circuit quntum electrodynamics using superconducting phase qubits and resonators. We propose a protocol where only one interaction between the two modes is required, creating all the necessary entanglement at the start of the procedure. This protocol makes active use of the first three states of the phase qubits. Additionally, we show how to efficiently verify the success of such an experiment, even for large NOON states, using randomly sampled measurements and semidefinite programming techniques.

quant-ph↗

arXiv2009

Random unitary maps for quantum state reconstruction

We study the possibility of performing quantum state reconstruction from a measurement record that is obtained as a sequence of expectation values of a Hermitian operator evolving under repeated application of a single random unitary map, U_0. We show that while this single-parameter orbit in operator space is not informationally complete, it can be used to yield surprisingly high-fidelity reconstruction. For a d-dimensional Hilbert space with the initial observable in su(d), the measurement record lacks information about a matrix subspace of dimension > d-2 out of the total dimension d^2-1. We determine the conditions on U_0 such that the bound is saturated, and show they are achieved by almost all pseudorandom unitary matrices. When we further impose the constraint that the physical density matrix must be positive, we obtain even higher fidelity than that predicted from the missing subspace. With prior knowledge that the state is pure, the reconstruction will be perfect (in the limit of vanishing noise) and for arbitrary mixed states, the fidelity is over 0.96, even for small d, and reaching F > 0.99 for d > 9. We also study the implementation of this protocol based on the relationship between random matrices and quantum chaos. We show that the Floquet operator of the quantum kicked top provides a means of generating the required type of measurement record, with implications on the relationship between quantum chaos and information gain.

quant-ph↗

arXiv2009

Constructing General Unitary Maps from State Preparations

We present an efficient algorithm for generating unitary maps on a $d$-dimensional Hilbert space from a time-dependent Hamiltonian through a combination of stochastic searches and geometric construction. The protocol is based on the eigen-decomposition of the map. A unitary matrix can be implemented by sequentially mapping each eigenvector to a fiducial state, imprinting the eigenphase on that state, and mapping it back to the eigenvector. This requires the design of only $d$ state-to-state maps generated by control waveforms that are efficiently found by a gradient search with computational resources that scale polynomially in $d$. In contrast, the complexity of a stochastic search for a single waveform that simultaneously acts as desired on all eigenvectors scales exponentially in $d$. We extend this construction to design maps on an $n$-dimensional subspace of the Hilbert space using only $n$ stochastic searches. Additionally, we show how these techniques can be used to control atomic spins in the ground electronic hyperfine manifold of alkali atoms in order to implement general qudit logic gates as well to perform a simple form of error correction on an embedded qubit.

quant-ph↗