Suppressing errors is the central challenge for useful quantum computing^{1}, requiring quantum error correction (QEC)^{2–6}for largescale processing. However, the overhead in the realization of errorcorrected ‘logical’ qubits, in which information is encoded across many physical qubits for redundancy^{2–4}, poses substantial challenges to largescale 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. Using logicallevel control and a zoned architecture in reconfigurable neutralatom arrays^{7}, our system combines high twoqubit gate fidelities^{8}, arbitrary connectivity^{7,9}, as well as fully programmable singlequbit rotations and midcircuit readout^{10–15}. Operating this logical processor with various types of encoding, we demonstrate improvement of a twoqubit logic gate by scaling surfacecode^{6}distance from
 NSFPAR ID:
 10273851
 Date Published:
 Journal Name:
 ACM Transactions on Quantum Computing
 Volume:
 2
 Issue:
 1
 ISSN:
 26436809
 Page Range / eLocation ID:
 1 to 30
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract d = 3 tod = 7, preparation of colourcode qubits with breakeven fidelities^{5}, faulttolerant creation of logical Greenberger–Horne–Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colourcode qubits. Finally, using 3D [[8,3,2]] code blocks^{16,17}, we realize computationally complex sampling circuits^{18}with up to 48 logical qubits entangled with hypercube connectivity^{19}with 228 logical twoqubit gates and 48 logical CCZ gates^{20}. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physicalqubit fidelities at both crossentropy benchmarking and quantum simulations of fast scrambling^{21,22}. These results herald the advent of early errorcorrected quantum computation and chart a path towards largescale logical processors. 
Quantum computing is gaining momentum in revolutionizing the way we approach complex problemsolving. However, the practical implementation of quantum algorithms remains a significant challenge due to the errorprone and hardware limits of nearterm quantum devices. For instance, physical qubit connections are limited, which necessitates the use of quantum SWAP gates to dynamically transform the logical topology during execution. In addition, to optimize fidelity, it is essential to ensure that 1) the allocated hardware has a low error rate and 2) the number of SWAP gates injected into the circuit is minimized. To address these challenges, we propose a suite of algorithms: the Fidelityaware Graph Extraction Algorithm (FGEA) is used to identify the hardware region with the lowest probability of error, the Frequencybased Mapping Algorithm (FMA) allocates logicalphysical qubits that reduce the potential distance of topological transformation, and the Heuristic Routing Algorithm (HRA) searches for an optimal swapping injection strategy. We evaluate the proposed algorithms on the IBMprovided Noisy IntermediateScale Quantum (NISQ) computer, using a dataset consisting of 17 different quantum circuits of various sizes. The circuits are executed on the IBM Toronto Falcon processor. The three proposed algorithms outperform the existing SABRE algorithm in reducing the number of SWAP gates required. Therefore, our proposed algorithms hold significant promise in enhancing the fidelity and reducing the number of SWAP gates required in implementing Quantum algorithms.more » « less

Quantum errorcorrecting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physical operators (circuits) acting on physical quantum states. We propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in CN ×N as a 2m × 2m binary sym plectic matrix, where N = 2m. We show that for an [m, m − k] stabilizer code every logical Clifford operator has 2k(k+1)/2 symplectic solutions, and we enumerate them efficiently using symplectic transvections. The desired circuits are then obtained by writing each of the solutions as a product of elementary symplectic matrices. For a given operator, our assembly of all of its physical realizations enables optimization over them with respect to a suitable metric. Our method of circuit synthesis can be applied to any stabilizer code, and this paper provides a proof of concept synthesis of universal Clifford gates for the well known [6, 4, 2] code. Programs implementing our algorithms can be found at https://github.com/nrenga/symplecticarxiv18a.more » « less

Dynamically fieldprogrammable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and nonlocal connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cuttingedge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQDPQA reduces the number of twoqubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQAbased compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less twoqubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

A basic question in the theory of faulttolerant quantum computation is to understand the fundamental resource costs for performing a universal logical set of gates on encoded qubits to arbitrary accuracy. Here we consider qubits encoded with constant space overhead (i.e. finite encoding rate) in the limit of arbitrarily large code distance d through the use of topological codes associated to triangulations of hyperbolic surfaces. We introduce explicit protocols to demonstrate how Dehn twists of the hyperbolic surface can be implemented on the code through constant depth unitary circuits, without increasing the space overhead. The circuit for a given Dehn twist consists of a permutation of physical qubits, followed by a constant depth local unitary circuit, where locality here is defined with respect to a hyperbolic metric that defines the code. Applying our results to the hyperbolic Fibonacci TuraevViro code implies the possibility of applying universal logical gate sets on encoded qubits through constant depth unitary circuits and with constant space overhead. Our circuits are inherently protected from errors as they map local operators to local operators while changing the size of their support by at most a constant factor; in the presence of noisy syndrome measurements, our results suggest the possibility of universal fault tolerant quantum computation with constant space overhead and time overhead of O ( d / log d ) . For quantum circuits that allow parallel gate operations, this yields the optimal scaling of spacetime overhead known to date.more » « less