arXiv subjects

Trevor Keen

Publications and source records attributed to Trevor Keen.

7 recordsLinked to original sources

arXiv2025

Bias-preserving and error-detectable entangling operations in a superconducting dual-rail system

For useful quantum computation, error-corrected machines are required that can dramatically reduce the inevitable errors experienced by physical qubits. While significant progress has been made in approaching and exceeding the surface-code threshold in superconducting platforms, large gains in the logical error rate with increasing system size remain out of reach. This is due both to the large number of required physical qubits and the need to operate far below threshold. Importantly, by exploiting the biases and structure of the physical errors, this threshold can be raised. Erasure qubits achieve this by detecting certain errors at the hardware level. Dual-rail qubits encoded in superconducting cavities are a promising erasure qubit wherein the dominant error, photon loss, can be detected and converted to an erasure. In these approaches, the complete set of operations, including two qubit gates, must be high performance and preserve as much of the desirable hierarchy or bias in the errors as possible. Here, we design and realize a novel two-qubit gate for dual-rail erasure qubits based on superconducting microwave cavities. The gate is high-speed ($\sim$500 ns duration), and yields a residual gate infidelity after error detection below 0.1%. Moreover, we experimentally demonstrate that this gate largely preserves the favorable error structure of idling dual-rail qubits, making it ideal for error correction. We measure low erasure rates of $\sim$0.5% per gate, as well as low and asymmetric dephasing errors that occur at least three times more frequently on control qubits compared to target qubits. Bit-flip errors are practically nonexistent, bounded at the few parts per million level. This error asymmetry has not been well explored but is extremely useful in quantum error correction and flag-qubit contexts, where it can create a faster path to effective error-corrected systems.

quant-ph↗

arXiv2023

Demonstrating a superconducting dual-rail cavity qubit with erasure-detected logical measurements

A critical challenge in developing scalable error-corrected quantum systems is the accumulation of errors while performing operations and measurements. One promising approach is to design a system where errors can be detected and converted into erasures. Such a system utilizing erasure qubits are known to have relaxed requirements for quantum error correction. A recent proposal aims to do this using a dual-rail encoding with superconducting cavities. However, experimental characterization and demonstration of a dual-rail cavity qubit has not yet been realized. In this work, we implement such a dual-rail cavity qubit; we demonstrate a projective logical measurement with integrated erasure detection and use it to measure dual-rail qubit idling errors. We measure logical state preparation and measurement errors at the $0.01\%$-level and detect over $99\%$ of cavity decay events as erasures. We use the precision of this new measurement protocol to distinguish different types of errors in this system, finding that while decay errors occur with probability $\sim 0.2\%$ per microsecond, phase errors occur 6 times less frequently and bit flips occur at least 140 times less frequently. These findings represent the first confirmation of the expected error hierarchy necessary to concatenate dual-rail erasure qubits into a highly efficient erasure code.

quant-ph↗

arXiv2023

Mapping the metal-insulator phase diagram by algebraically fast-forwarding dynamics on a cloud quantum computer

Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model and thus gives an approximate solution of the Hubbard model from the solution of simpler quantum impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models by preparing and evolving the ground state under the impurity Hamiltonian on a quantum computer that is assumed to have the scalability and accuracy far beyond the current state-of-the-art quantum hardware. As a proof of principle demonstration targeting the Anderson impurity model we close the DMFT loop with current noisy hardware. With a highly optimized fast-forwarding quantum circuit and a noise resilient spectral analysis we observe a Mott phase transition. Based on a Cartan decomposition, our algorithm gives a fixed depth, fast-forwarding, quantum circuit that can evolve the initial state over arbitrarily long times without time-discretization errors typical of other product decomposition formulas such as Trotter decomposition. By exploiting the structure of the fast-forwarding circuits we reduce the gate count (to 77 CNOTs after optimization), simulate the dynamics, and extract frequencies from the Anderson impurity model on noisy quantum hardware. We then demonstrate the Mott transition by mapping the full metal-insulator phase-diagram. Near the Mott phase transition, our method maintains accuracy where Trotter error would otherwise dominate due to the long-time evolution required to resolve quasiparticle resonance frequency extremely close to zero. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware, made viable by a highly optimized computation in terms of gate depth, simulation error, and runtime on quantum hardware.

quant-ph↗

arXiv2022

Hybrid quantum-classical approach for coupled-cluster Green's function theory

The three key elements of a quantum simulation are state preparation, time evolution, and measurement. While the complexity scaling of time evolution and measurements are well known, many state preparation methods are strongly system-dependent and require prior knowledge of the system's eigenvalue spectrum. Here, we report on a quantum-classical implementation of the coupled-cluster Green's function (CCGF) method, which replaces explicit ground state preparation with the task of applying unitary operators to a simple product state. While our approach is broadly applicable to many models, we demonstrate it here for the Anderson impurity model (AIM). The method requires a number of $T$ gates that grows as $ \mathcal{O} \left(N^5 \right)$ per time step to calculate the impurity Green's function in the time domain, where $N$ is the total number of energy levels in the AIM. Since the number of $T$ gates is analogous to the computational time complexity of a classical simulation, we achieve an order of magnitude improvement over a classical CCGF calculation of the same order, which requires $ \mathcal{O} \left(N^6 \right)$ computational resources per time step.

quant-ph↗

arXiv2021

Quantum Algorithms for Ground-State Preparation and Green's Function Calculation

We propose quantum algorithms for projective ground-state preparation and calculations of the many-body Green's functions directly in frequency domain. The algorithms are based on the linear combination of unitary (LCU) operations and essentially only use quantum resources. To prepare the ground state, we construct the operator ${\exp}(-τ\hat{H}^2)$ using Hubbard-Stratonovich transformation by LCU and apply it on an easy-to-prepare initial state. Our projective state preparation procedure saturates the near-optimal scaling, $\mathcal{O}(\frac{1}{γΔ} \log \frac{1}{γη})$, of other currently known algorithms, in terms of the spectral-gap lower bound $Δ$, the additive error $η$ in the state vector, and the overlap lower bound $γ$ between the initial state and the exact ground state. It is straightforward to combine our algorithm with spectral-gap amplification technique to achieve quadratically improved scaling $\mathcal{O}(1/\sqrtΔ)$ for ground-state preparation of frustration-free Hamiltonians, which we demonstrate with numerical results of the $q$-deformed XXZ chain. To compute the Green's functions, including the single-particle and other response functions, we act on the prepared ground state with the retarded resolvent operator $R(ω+ iΓ; \hat{H})$ in the LCU form derived from the Fourier-Laplace integral transform (FIT). Our resolvent algorithm has $\mathcal{O}(\frac{1}{Γ^2} \log\frac{1}{Γε})$ complexity scaling for the frequency resolution $Γ$ of the response functions and the targeted error $ε$, while classical algorithms for FIT usually have polynomial scaling over the error $ε$. To illustrate the complexity scaling of our algorithms, we provide numerical results for their application to the paradigmatic Fermi-Hubbard model on a one-dimensional lattice with different numbers of sites.

quant-ph↗

arXiv2021

Quantum-classical simulation of two-site dynamical mean-field theory on noisy quantum hardware

We report on a quantum-classical simulation of the single-band Hubbard model using two-site dynamical mean-field theory (DMFT). Our approach uses IBM's superconducting qubit chip to compute the zero-temperature impurity Green's function in the time domain and a classical computer to fit the measured Green's functions and extract their frequency domain parameters. We find that the quantum circuit synthesis (Trotter) and hardware errors lead to incorrect frequency estimates, and subsequently to an inaccurate quasiparticle weight when calculated from the frequency derivative of the self-energy. These errors produce incorrect hybridization parameters that prevent the DMFT algorithm from converging to the correct self-consistent solution. To avoid this pitfall, we compute the quasiparticle weight by integrating the quasiparticle peaks in the spectral function. This method is much less sensitive to Trotter errors and allows the algorithm to converge to self-consistency for a half-filled Mott insulating system after applying quantum error mitigation techniques to the quantum simulation data.

quant-ph↗

arXiv2021

State preparation and evolution in quantum computing: a perspective from Hamiltonian moments

Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quantum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ devices impedes the conventional quantum algorithms to be implemented. Practical strategies usually exploit hybrid quantum classical algorithms to demonstrate potentially useful applications of quantum computing in the NISQ era. Among the numerous hybrid algorithms, recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments, $\langle ϕ| \hat{\mathcal{H}}^n | ϕ\rangle$ ($n=1,2,\cdots$), with respect to quantum state $|ϕ\rangle$. In this tutorial, we will give a brief review of these quantum algorithms with focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies based on the quantum computed moments. Furthermore, we will present a tutorial to show how we can measure and compute the Hamiltonian moments of a four-site Heisenberg model, and compute the energy and magnetization of the model utilizing the imaginary time evolution in the real IBM-Q NISQ hardware environment. Along this line, we will further discuss some practical issues associated with these algorithms. We will conclude this tutorial review by overviewing some possible developments and applications in this direction in the near future.

quant-ph↗