In this paper, we investigate how quantum architectures affect the efficiency of the execution of the quantum Fourier transform (QFT) and linear transformations, which are essential parts of the stabilizer/Clifford group circuits. In particular, we show that in most common and realistic physical architectures including the linear nearest neighbor, two-dimensional lattice, and bounded degree graph (containing a chain of length n), n-qubit QFT and n-qubit stabilizer circuits can be parallelized to linear depth using no auxiliary qubits. We construct lower bounds that show the efficiency of our approach.
We describe a class of "neighboring-blocks" stabilizer quantum error correction codes and demonstrate that such class of codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of 3-qubit repetition code, Laflamme's 5-qubit code, and Shor's 9-qubit code. For 3-qubit repetition code and Laflamme's 5-qubit code suggested scheme has the property that it uses only native two-qubit CNS gates, which potenti…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that preserve them. Such states are obtained by stabilizer circuits (consisting of CNOT, Hadamard and Phase gates) and can be represented compactly on conventional computers using $O(n^2)$ bits, where $n$ is the number of qubits. As an additional application, the work by Aaronson and Gottesman suggests the use of superpositions of stabilizer states to represent arbitra…
Reduced-State Stabilizer Rényi Entropy as a Probe of Quantum Criticality in the Transverse ANNNI Model and the Quantum Compass Model
National Institute of Technology Sikkim（锡金国家技术学院）；Tamkang University（淡江大学）；Hon Hai Research Institute（鸿海研究院）；National Center for Theoretical Sciences（国家理论科学中心）
Stabilizer-Rényi Microscopy of Critical Correlations in Interacting Fermions
School of Physics and Astronomy, Shanghai Jiao Tong University（上海交通大学物理与天文学院）；Tsung-Dao Lee Institute, Shanghai Jiao Tong University（上海交通大学李政道研究所）；Hefei National Laboratory（合肥国家实验室）
In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in Phys. Rev. A 70(052328), 2004: to obtain a general stabilizer circuit, we reduce their $11$-stage computation -H-C-P-C-P-C-H-P-C-P-C- over the gate set consisting of Hadamard, Controlled-NOT, and Phase gates, into a $7$-stage computation of the form -C-CZ-P-H-P-CZ-C-. We show arguments in support of using -CZ- stages over the -C- stages: not only the use of -CZ- stages allows a shorter layered expression, but -CZ- stages are simpler and appear to be easier to implement c…
Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering
Tsinghua University（清华大学）；TraverseQuantum Co., Ltd.（纵横量子有限公司）；Zhongguancun Laboratory（中关村实验室）；Pengcheng Laboratory（鹏城实验室）；The Hong Kong University of Science and Technology（香港科技大学）
Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
School of Electrical and Computer Engineering, Cornell University（康奈尔大学电气与计算机工程学院）；School of Applied and Engineering Physics, Cornell University（康奈尔大学应用与工程物理学院）；Institute of Natural Sciences, Shanghai Jiao Tong University（上海交通大学自然科学研究院）；School of Mathematical Sciences, Shanghai Jiao Tong University（上海交通大学数学科学学院）
Non-local higher-energy auxiliary states have been successfully used to entangle pairs of qubits in different quantum computing systems. Typically a longer-span non-local state or sequential application of few-qubit entangling gates are needed to produce a non-trivial multiqubit gate. In many cases a single non-local state that span over the entire system is difficult to use due to spectral crowding or impossible to have. At the same time, many multiqubit systems can naturally develop a network of multiple non-local higher-energy states that span over few qubits each. We show that continuous t…
We introduce a minimal model for realizing a fast-to-slow scrambling transition mediated by an auxiliary central qubit (c-qubit). The c-qubit is coupled to a spin-$1/2$ Ising model with local Ising interactions and tunable c-qubit-spin coupling. Each spin becomes next-nearest neighbor to all others through the c-qubit, which mediates effective all-to-all interactions. As the interaction with the c-spin increases, we find a surprising transition from super-ballistic scrambling and information growth to continuously restricted sub-ballistic entanglement and operator growth. This slow growth occu…
We present a scalable scheme for executing the error-correction cycle of a monolithic surface-code fabric composed of fast-flux-tuneable transmon qubits with nearest-neighbor coupling. An eight-qubit unit cell forms the basis for repeating both the quantum hardware and coherent control, enabling spatial multiplexing. This control uses three fixed frequencies for all single-qubit gates and a unique frequency detuning pattern for each qubit in the cell. By pipelining the interaction and readout steps of ancilla-based $X$- and $Z$-type stabilizer measurements, we can engineer detuning patterns th…
Experimental realization of stabilizer-based quantum error correction (QEC) codes that would yield superior logical qubit performance is one of the formidable task for state-of-the-art quantum processors. A major obstacle towards realizing this goal is the large footprint of QEC codes, even those with a small distance. We propose a circuit based on the minimal distance-3 QEC code, which requires only 5 data qubits and 5 ancilla qubits, connected in a ring with iSWAP gates implemented between neighboring qubits. Using a density-matrix simulation, we show that, thanks to its smaller footprint, t…
The overhead cost of performing universal fault-tolerant quantum computation for large scale quantum algorithms is very high. Despite several attempts at alternative schemes, magic state distillation remains one of the most efficient schemes for simulating non-Clifford gates in a fault-tolerant way. However, since magic state distillation circuits are not fault-tolerant, all Clifford operations must be encoded in a large distance code in order to have comparable failure rates with the magic states being distilled. In this work, we introduce a new concept which we call redundant ancilla encodin…
Adaptive Deformation of Color Code in Square Lattices with Defects
University of Science and Technology of China（中国科学技术大学）；Institute of Artificial Intelligence, Hefei Comprehensive National Science Center（合肥综合性国家科学中心人工智能研究院）；Origin Quantum Computing Technology (Hefei) Co., Ltd.（本源量子计算技术（合肥）有限公司）
Quantum error correction is crucial for any quantum computing platform to achieve truly scalable quantum computation. The surface code and its variants have been considered the most promising quantum error correction scheme due to their high threshold, low overhead, and relatively simple structure that can naturally be implemented in many existing qubit architectures, such as superconducting qubits. The recent development of Floquet codes offers another promising approach. By going beyond the usual paradigm of stabilizer codes, Floquet codes achieve similar performance while being constructed …
Fault-tolerant quantum computation with static atomic buses
University of Strasbourg（斯特拉斯堡大学）；CNRS（法国国家科学研究中心）；CESQ（量子化学中心）；ISIS（结构与成像研究所）；Department of Physics, University of Wisconsin-Madison（威斯康星大学麦迪逊分校物理系）；QPerfect SAS（QPerfect公司）；Institut Universitaire de France (IUF)（法兰西学院）；Infleqtion（Infleqtion公司）
We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-read…
Planckian srl（Planckian有限公司）；NEST, Scuola Normale Superiore（NEST，比萨高等师范学院）；Department of Mechanical Engineering, Massachusetts Institute of Technology（麻省理工学院机械工程系）
