18 December 2023 in Physical Review X
We describe and benchmark a new quantum charge-coupled device (QCCD) trapped-ion quantum computer based on a linear trap with periodic boundary conditions, which resembles a race track. The new system successfully incorporates several technologies crucial to future scalability—including electrode broadcasting, multilayer rf routing, and magneto-optical trap (MOT) loading—while maintaining, and in some cases exceeding, the gate fidelities of previous QCCD systems. The system is initially operated with 32 qubits, but future upgrades will allow for more. We benchmark the performance of primitive operations, including an average state preparation and measurement error of , an average single-qubit gate infidelity of , and an average two-qubit gate infidelity of . The system-level performance of the quantum processor is assessed with mirror benchmarking, linear cross-entropy benchmarking, a quantum volume measurement of , and the creation of 32-qubit entanglement in a GHZ state. We also tested application benchmarks, including Hamiltonian simulation, QAOA, error correction on a repetition code, and dynamics simulations using qubit reuse. We also discuss future upgrades to the new system aimed at adding more qubits and capabilities.
27 July 2018 in Physical Review X
Traditional computational methods for studying quantum many-body systems are “forward methods,” which take quantum models, i.e., Hamiltonians, as input and produce ground states as output. However, such forward methods often limit one’s perspective to a small fraction of the space of possible Hamiltonians. We introduce an alternative computational “inverse method,” the eigenstate-to-Hamiltonian construction (EHC), that allows us to better understand the vast space of quantum models describing strongly correlated systems. EHC takes as input a wave function and produces as output Hamiltonians for which is an eigenstate. This is accomplished by computing the quantum covariance matrix, a quantum mechanical generalization of a classical covariance matrix. EHC is widely applicable to a number of models and, in this work, we consider seven different examples. Using the EHC method, we construct a parent Hamiltonian with a new type of antiferromagnetic ground state, a parent Hamiltonian with two different targeted degenerate ground states, and large classes of parent Hamiltonians with the same ground states as well-known quantum models, such as the Majumdar-Ghosh model, the XX chain, the Heisenberg chain, the Kitaev chain, and a 2D BdG model. EHC gives an alternative inverse approach for studying quantum many-body phenomena.
22 December 2023 in Physical Review X
A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets. In addition to being crucial for quantum error correction, this capability can help reduce the number of qubits needed to execute many types of quantum algorithms by measuring qubits as early as possible, resetting them, and reusing them elsewhere in the circuit. In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qubits to execute due to qubit reuse. We present two algorithms for performing qubit-reuse compilation: an exact constraint programming optimization model and a greedy heuristic. We introduce the concept of dual circuits, obtained by exchanging state preparations with measurements and vice versa and reversing time, and show that optimal qubit-reuse compilation requires the same number of qubits to execute a circuit as its dual. We illustrate the performance of these algorithms on a variety of relevant near-term quantum circuits, such as one-dimensional and two-dimensional time-evolution circuits, and numerically benchmark their performance on the quantum adiabatic optimization algorithm (QAOA) applied to the MaxCut problem on random three-regular graphs. To demonstrate the practical benefit of these techniques, we experimentally realize an 80-qubit QAOA MaxCut circuit on the 20-qubit Quantinuum H1-1 trapped-ion quantum processor using qubit-reuse compilation algorithms.
4 August 2022 in Nature Physics
11 September 2023 in Nature Physics
7 May 2021 in Physical Review Letters
Disorder and interactions can lead to the breakdown of statistical mechanics in certain quantum systems, a phenomenon known as many-body localization (MBL). Much of the phenomenology of MBL emerges from the existence of , a set of conserved quantities that are quasilocal and binary (i.e., possess only eigenvalues). While MBL and are known to exist in one-dimensional systems, their existence in dimensions greater than one is a key open question. To tackle this question, we develop an algorithm that can find approximate binary in arbitrary dimensions by adaptively generating a basis of operators in which to represent the . We use the algorithm to study four models: the one-, two-, and three-dimensional disordered Heisenberg models and the two-dimensional disordered hard-core Bose-Hubbard model. For all four of the models studied, our algorithm finds high-quality at large disorder strength and rapid qualitative changes in the distributions of in particular ranges of disorder strengths, suggesting the existence of MBL transitions. These transitions in the one-dimensional Heisenberg model and two-dimensional Bose-Hubbard model coincide well with past estimates of the critical disorder strengths in these models, which further validates the evidence of MBL phenomenology in the other two- and three-dimensional models we examine. In addition to finding MBL behavior in higher dimensions, our algorithm can be used to probe MBL in various geometries and dimensionality.