Searcharxiv⌕ Search

arXiv subjects

Iris Cong

Publications and source records attributed to Iris Cong.

12 recordsLinked to original sources
arXiv2023

Logical quantum processor based on reconfigurable atom arrays

Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction for large-scale processing. However, the overhead in the realization of error-corrected ``logical'' qubits, where information is encoded across many physical qubits for redundancy, poses significant challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Utilizing logical-level control and a zoned architecture in reconfigurable neutral atom arrays, our system combines high two-qubit gate fidelities, arbitrary connectivity, as well as fully programmable single-qubit rotations and mid-circuit readout. Operating this logical processor with various types of encodings, we demonstrate improvement of a two-qubit logic gate by scaling surface code distance from d=3 to d=7, preparation of color code qubits with break-even fidelities, fault-tolerant creation of logical GHZ states and feedforward entanglement teleportation, as well as operation of 40 color code qubits. Finally, using three-dimensional [[8,3,2]] code blocks, we realize computationally complex sampling circuits with up to 48 logical qubits entangled with hypercube connectivity with 228 logical two-qubit gates and 48 logical CCZ gates. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling. These results herald the advent of early error-corrected quantum computation and chart a path toward large-scale logical processors.

quant-ph↗
arXiv2023

Robust Hamiltonian Engineering for Interacting Qudit Systems

We develop a formalism for the robust dynamical decoupling and Hamiltonian engineering of strongly interacting qudit systems. Specifically, we present a geometric formalism that significantly simplifies qudit pulse sequence design, while incorporating the necessary robustness conditions. We experimentally demonstrate these techniques in a strongly-interacting, disordered ensemble of spin-1 nitrogen-vacancy centers, achieving over an order of magnitude improvement in coherence time over existing pulse sequences. We further describe how our techniques enable the engineering of exotic many-body phenomena such as quantum many-body scars, and allow enhanced sensitivities for quantum metrology. These results enable the engineering of a whole new class of complex qudit Hamiltonians, with wide-reaching applications in dynamical decoupling, many-body physics and quantum metrology.

quant-ph↗
arXiv2022

Enhancing Detection of Topological Order by Local Error Correction

The exploration of topologically-ordered states of matter is a long-standing goal at the interface of several subfields of the physical sciences. Such states feature intriguing physical properties such as long-range entanglement, emergent gauge fields and non-local correlations, and can aid in realization of scalable fault-tolerant quantum computation. However, these same features also make creation, detection, and characterization of topologically-ordered states particularly challenging. Motivated by recent experimental demonstrations, we introduce a new paradigm for quantifying topological states -- locally error-corrected decoration (LED) -- by combining methods of error correction with ideas of renormalization-group flow. Our approach allows for efficient and robust identification of topological order, and is applicable in the presence of incoherent noise sources, making it particularly suitable for realistic experiments. We demonstrate the power of LED using numerical simulations of the toric code under a variety of perturbations. We subsequently apply it to an experimental realization, providing new insights into a quantum spin liquid created on a Rydberg-atom simulator. Finally, we extend LED to generic topological phases, including those with non-abelian order.

quant-ph↗
arXiv2021

Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms

Neutral atom arrays have recently emerged as a promising platform for quantum information processing. One important remaining roadblock for the large-scale application of these systems is the ability to perform error-corrected quantum operations. To entangle the qubits in these systems, atoms are typically excited to Rydberg states, which could decay or give rise to various correlated errors that cannot be addressed directly through traditional methods of fault-tolerant quantum computation. In this work, we provide the first complete characterization of these sources of error in a neutral-atom quantum computer and propose hardware-efficient, fault-tolerant quantum computation schemes that mitigate them. Notably, we develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. These advances allow us to significantly reduce the resource cost for fault-tolerant quantum computation compared to existing, general-purpose schemes. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.

quant-ph↗
arXiv2021

Many-body quantum teleportation via operator spreading in the traversable wormhole protocol

By leveraging shared entanglement between a pair of qubits, one can teleport a quantum state from one particle to another. Recent advances have uncovered an intrinsically many-body generalization of quantum teleportation, with an elegant and surprising connection to gravity. In particular, the teleportation of quantum information relies on many-body dynamics, which originate from strongly-interacting systems that are holographically dual to gravity; from the gravitational perspective, such quantum teleportation can be understood as the transmission of information through a traversable wormhole. Here, we propose and analyze a new mechanism for many-body quantum teleportation -- dubbed peaked-size teleportation. Intriguingly, peaked-size teleportation utilizes precisely the same type of quantum circuit as traversable wormhole teleportation, yet has a completely distinct microscopic origin: it relies upon the spreading of local operators under generic thermalizing dynamics and not gravitational physics. We demonstrate the ubiquity of peaked-size teleportation, both analytically and numerically, across a diverse landscape of physical systems, including random unitary circuits, the Sachdev-Ye-Kitaev model (at high temperatures), one-dimensional spin chains and a bulk theory of gravity with stringy corrections. Our results pave the way towards using many-body quantum teleportation as a powerful experimental tool for: (i) characterizing the size distributions of operators in strongly-correlated systems and (ii) distinguishing between generic and intrinsically gravitational scrambling dynamics. To this end, we provide a detailed experimental blueprint for realizing many-body quantum teleportation in both trapped ions and Rydberg atom arrays; effects of decoherence and experimental imperfections are analyzed.

quant-ph↗
arXiv2019

Quantum Convolutional Neural Networks

We introduce and analyze a novel quantum machine learning model motivated by convolutional neural networks. Our quantum convolutional neural network (QCNN) makes use of only $O(\log(N))$ variational parameters for input sizes of $N$ qubits, allowing for its efficient training and implementation on realistic, near-term quantum devices. The QCNN architecture combines the multi-scale entanglement renormalization ansatz and quantum error correction. We explicitly illustrate its potential with two examples. First, QCNN is used to accurately recognize quantum states associated with 1D symmetry-protected topological phases. We numerically demonstrate that a QCNN trained on a small set of exactly solvable points can reproduce the phase diagram over the entire parameter regime and also provide an exact, analytical QCNN solution. As a second application, we utilize QCNNs to devise a quantum error correction scheme optimized for a given error model. We provide a generic framework to simultaneously optimize both encoding and decoding procedures and find that the resultant scheme significantly outperforms known quantum codes of comparable complexity. Finally, potential experimental realization and generalizations of QCNNs are discussed.

quant-ph↗
arXiv2018

Hamiltonian and Algebraic Theories of Gapped Boundaries in Topological Phases of Matter

We present an exactly solvable lattice Hamiltonian to realize gapped boundaries of Kitaev's quantum double models for Dijkgraaf-Witten theories. We classify the elementary excitations on the boundary, and systematically describe the bulk-to-boundary condensation procedure. We also present the parallel algebraic/categorical structure of gapped boundaries.

cond-mat.str-el↗
arXiv2017

Universal Quantum Computation with Gapped Boundaries

This Letter discusses topological quantum computation with gapped boundaries of two-dimensional topological phases. Systematic methods are presented to encode quantum information topologically using gapped boundaries, and to perform topologically protected operations on this encoding. In particular, we introduce a new and general computational primitive of topological charge measurement and present a symmetry-protected implementation of this primitive. Throughout the Letter, a concrete physical example, the $\mathbb{Z}_3$ toric code ($\mathfrak{D}(\mathbb{Z}_3)$), is discussed. For this example, we have a qutrit encoding and an abstract universal gate set. Physically, gapped boundaries of $\mathfrak{D}(\mathbb{Z}_3)$ can be realized in bilayer fractional quantum Hall $1/3$ systems. If a practical implementation is found for the required topological charge measurement, these boundaries will give rise to a direct physical realization of a universal quantum computer based on a purely abelian topological phase.

quant-ph↗
arXiv2017

On Defects Between Gapped Boundaries in Two-Dimensional Topological Phases of Matter

Defects between gapped boundaries provide a possible physical realization of projective non-abelian braid statistics. A notable example is the projective Majorana/parafermion braid statistics of boundary defects in fractional quantum Hall/topological insulator and superconductor heterostructures. In this paper, we develop general theories to analyze the topological properties and projective braiding of boundary defects of topological phases of matter in two spatial dimensions. We present commuting Hamiltonians to realize defects between gapped boundaries in any $(2+1)D$ untwisted Dijkgraaf-Witten theory, and use these to describe their topological properties such as their quantum dimension. By modeling the algebraic structure of boundary defects through multi-fusion categories, we establish a bulk-edge correspondence between certain boundary defects and symmetry defects in the bulk. Even though it is not clear how to physically braid the defects, this correspondence elucidates the projective braid statistics for many classes of boundary defects, both amongst themselves and with bulk anyons. Specifically, three such classes of importance to condensed matter physics/topological quantum computation are studied in detail: (1) A boundary defect version of Majorana and parafermion zero modes, (2) a similar version of genons in bilayer theories, and (3) boundary defects in $\mathfrak{D}(S_3)$.

cond-mat.str-el↗
arXiv2016

Topological Quantum Computation with Gapped Boundaries

This paper studies fault-tolerant quantum computation with gapped boundaries. We first introduce gapped boundaries of Kitaev's quantum double models for Dijkgraaf-Witten theories using their Hamiltonian realizations. We classify the elementary excitations on the boundary, and systematically describe the bulk-to-boundary condensation procedure. We also provide a commuting Hamiltonian to realize defects between boundaries in any quantum double model. Next, we present the algebraic/categorical structure of gapped boundaries and boundary defects, which will be used to describe topologically protected operations and obtain quantum gates. To demonstrate a potential physical realization, we provide quantum circuits for surface codes that can perform all basic operations on gapped boundaries. Finally, we show how gapped boundaries of the abelian theory $\mathfrak{D}(\mathbb{Z}_3)$ can be used to perform universal quantum computation.

quant-ph↗
arXiv2016

Quantum Discriminant Analysis for Dimensionality Reduction and Classification

We present quantum algorithms to efficiently perform discriminant analysis for dimensionality reduction and classification over an exponentially large input data set. Compared with the best-known classical algorithms, the quantum algorithms show an exponential speedup in both the number of training vectors $M$ and the feature space dimension $N$. We generalize the previous quantum algorithm for solving systems of linear equations [Phys. Rev. Lett. 103, 150502 (2009)] to efficiently implement a Hermitian chain product of $k$ trace-normalized $N \times N$ Hermitian positive-semidefinite matrices with time complexity of $O(\log (N))$. Using this result, we perform linear as well as nonlinear Fisher discriminant analysis for dimensionality reduction over $M$ vectors, each in an $N$-dimensional feature space, in time $O(p \text{polylog} (MN)/ε^{3})$, where $ε$ denotes the tolerance error, and $p$ is the number of principal projection directions desired. We also present a quantum discriminant analysis algorithm for data classification with time complexity $O(\log (MN)/ε^{3})$.

quant-ph↗