Mapping quantum error correcting codes to classical disordered statistical mechanics models and studying the phase diagram of the latter has proven a powerful tool to study the fundamental error robustness and associated critical error thresholds of leading quantum error correcting codes under phenomenological noise models. In this work, we extend this mapping to admit realistic, multi-parameter faulty quantum circuits in the description of quantum error correcting codes. Based on the underlying microscopic circuit noise model, we first systematically derive the associated strongly correlated classical spin models. We illustrate this approach in detail for the example of a quantum repetition code in which faulty stabilizer readout circuits are periodically applied. Finally, we use Monte-Carlo simulations to study the resulting phase diagram of the associated interacting spin model and benchmark our results against a minimum-weight perfect matching decoder. The presented method provides an avenue to assess the fundamental thresholds of QEC codes and associated readout circuitry, independent of specific decoding strategies, and can thereby help guiding the development of near-term QEC hardware.
We focus on the depth optimization of CNOT circuits on hardwares with limited connectivity. We adapt the algorithm from Kutin et al. that implements any $n$-qubit CNOT circuit in depth at most $5n$ on a Linear Nearest Neighbour (LNN) architecture. Our proposal is a block version of Kutin et al.'s algorithm that is scalable with the number of interactions available in the hardware: the more interactions we have the less the depth. We derive better theoretical upper bounds and we provide a simple implementation of the algorithm. Overall, we achieve better depth complexity for CNOT circuits on so…
We investigate the Cherenkov radiation triggered by qubit acceleration simulated by superconducting circuit. By analyzing the radiation probability, we confirm the existence of Cherenkov speed threshold, implying that simulating superluminal qubit motion is possible for such a scenario. A question immediately arises: Is such motion compatible with the causality principle? To address the question, we perform a causality test on the simulating system based on the recently developed notion of temporal quantum correlations, pseudo-density matrix and temporal quantum steering. The results suggest t…
We provide evidence that commonly held intuitions when designing quantum circuits can be misleading. In particular we show that: a) reducing the T-count can increase the total depth; b) it may be beneficial to trade CNOTs for measurements in NISQ circuits; c) measurement-based uncomputation of relative phase Toffoli ancillae can make up to 30\% of a circuit's depth; d) area and volume cost metrics can misreport the resource analysis. Our findings assume that qubits are and will remain a very scarce resource. The results are applicable for both NISQ and QECC protected circuits. Our method uses …
Singular value thresholding (SVT) operation is a fundamental core module in many mathematical models in computer vision and machine learning, particularly for many nuclear norm minimizing-based problems. We presented a quantum SVT (QSVT) algorithm which was used as a subroutine to address an image classification problem. This algorithm runs in $O\left[\log\left(pq\right)\right]$, an exponential speed improvement over the classical algorithm which runs in $O\left[poly\left(pq\right)\right]$. In this study, we investigate this algorithm and design a scalable quantum circuit for QSVT. In the circ…
Analytical and numerical arguments are presented in case of a pair of two-state systems in a singlet state that the threshold visibility for testing Bell's theorem on the entire range of measurement settings is 33.3%. It is also shown that no lower treshold exists.
Demonstrating quantum supremacy, a complexity-guaranteed quantum advantage against over the best classical algorithms by using less universal quantum devices, is an important near-term milestone for quantum information processing. Here we develop a threshold theorem for quantum supremacy with noisy quantum circuits in the pre-threshold region, where quantum error correction does not work directly. We show that, even in such a region, we can virtually simulate quantum error correction by postselection. This allows us to show that the output sampled from the noisy quantum circuits (without posts…
Color code thresholds under circuit-level noise beyond the Pauli framework
INFN, Sezione di Padova（意大利国家核物理研究所帕多瓦分部）；Institute for Complex Quantum Systems, Ulm University（乌尔姆大学复杂量子系统研究所）；Padua Quantum Technologies Research Center, Università degli Studi di Padova（帕多瓦大学帕多瓦量子技术中心）
Quantum circuits implementing fault-tolerant quantum error correction (QEC) for the three qubit bit-flip code and five-qubit code are studied. To describe the effect of noise, we apply a model based on a generalized effective Hamiltonian where the system-environment interactions are taken into account by including stochastic fluctuating terms in the system Hamiltonian. This noise model enables us to investigate the effect of noise in quantum circuits under realistic device conditions and avoid strong assumptions such as maximal parallelism and weak storage errors. Noise thresholds of the QEC c…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction (current techniques cannot correct all small errors). The initial state in the circuit model computation is obtained by applying potentially imprecise Hadamard gate operations whereas useful quantum computation requires a state with no uncertainty. We review some limitations of the circuit model and speculate on the question if a hierarchy of quantum-type co…
We introduce a technique that uses gauge fixing to significantly improve the quantum error correcting performance of subsystem codes. By changing the order in which check operators are measured, valuable additional information can be gained, and we introduce a new method for decoding which uses this information to improve performance. Applied to the subsystem toric code with three-qubit check operators, we increase the threshold under circuit-level depolarising noise from $0.67\%$ to $0.81\%$. The threshold increases further under a circuit-level noise model with small finite bias, up to $2.22…
Surface codes exploit topological protection to increase error resilience in quantum computing devices and can in principle be implemented in existing hardware. They are one of the most promising candidates for active error correction, not least due to a polynomial-time decoding algorithm which admits one of the highest predicted error thresholds. We consider the dependence of this threshold on underlying assumptions including different noise models, and analyze the performance of a minimum weight perfect matching (MWPM) decoding compared to a mathematically optimal maximum likelihood (ML) dec…
We prove new upper bounds on the tolerable level of noise in a quantum circuit. We consider circuits consisting of unitary k-qubit gates each of whose input wires is subject to depolarizing noise of strength p, as well as arbitrary one-qubit gates that are essentially noise-free. We assume that the output of the circuit is the result of measuring some designated qubit in the final state. Our main result is that for p>1-Θ(1/\sqrt{k}), the output of any such circuit of large enough depth is essentially independent of its input, thereby making the circuit useless. For the important special case o…
Compiling quantum circuits to realistic hardware architectures using temporal planners
NASA Ames Research Center, Quantum Artificial Intelligence Laboratory（美国国家航空航天局阿姆斯研究中心，量子人工智能实验室）；USRA Research Institute for Advanced Computer Science (RIACS)（美国宇航局高级计算机科学研究所（RIACS））；Stinger Ghaffarian Technologies (SGT Inc.)（Stinger Ghaffarian技术（SGT公司））；NASA Ames Research Center, Planning and Scheduling Group（美国国家航空航天局阿姆斯研究中心，计划与调度组）
In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably. This cost generally increases quadratically with the block size of the underlying quantum error-correcting code. In consequence, large codes that are otherwise very efficient have found limited fault-tolerance applications. Fault-tolerant preparation circuits therefore are an important target for optimization. We study the Golay code, a 23-qubit quantum error-correcting code that protects the logical qubit to a distance of seven. In simulations, even using a naive ancilla p…
Shortcuts to adiabaticity is a general method for speeding up adiabatic quantum protocols, and has many potential applications in quantum information processing. Unfortunately, analytically constructing shortcuts to adiabaticity for systems having complex interactions and more than a few levels is a challenging task. This is usually overcome by assuming an idealized Hamiltonian [e.g., only a limited subset of energy levels are retained, and the rotating-wave approximation (RWA) is made]. Here we develop an $analytic$ approach that allows one to go beyond these limitations. Our method is genera…
Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the relationships between the noise model, encoding scheme, and threshold value. For general circuits and noise models, these simulations quickly become intractable in the size of the encoded circuit. We introduce methods for approximating a noise process by one which allows for efficient Monte Carlo simulation of properties of encoded circuits. The approximations are a…
When a frequency chirped excitation is applied to a classical high-Q nonlinear oscillator, its motion becomes dynamically synchronized to the drive and large oscillation amplitude is observed, provided the drive strength exceeds the critical threshold for autoresonance. We demonstrate that when such an oscillator is strongly coupled to a quantized superconducting qubit, both the effective nonlinearity and the threshold become a non-trivial function of the qubit-oscillator detuning. Moreover, the autoresonant threshold is sensitive to the quantum state of the qubit and may be used to realize a …
Probing the Error-Mitigation Threshold with Matrix Product States
Joint Quantum Institute and Joint Center for Quantum Information and Computer Science, University of Maryland（马里兰大学联合量子研究所与联合量子信息与计算科学中心）；National Institute of Standards and Technology（美国国家标准与技术研究院）
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable correct output of logical qubits under the presence of errors. However, strict requirements to encode qubits and operators render the implementation of a full fault-tolerant computation challenging even for the achievable noisy intermediate-scale quantum technology. Here, we experimentally demonstrate the existence of the threshold in a special fault-toleran…
Lattice surgery is a measurement-based technique for performing fault-tolerant quantum computation in two dimensions. When using the surface code, the most general lattice surgery operations require lattice irregularities called twist defects. However, implementing twist-based lattice surgery may require additional resources, such as extra device connectivity, and could lower the threshold and overall performance for the surface code. Here we provide an explicit twist-based lattice surgery protocol and its requisite connectivity layout. We also provide new stabilizer measurement circuits for m…
In the shallow sub-threshold regime, fault-tolerant quantum computation requires a tremendous amount of qubits. In this paper, we study the error correction in the deep sub-threshold regime. We estimate the physical error rate for achieving the logical error rates of $10^{-6} - 10^{-15}$ using few-qubit codes, i.e. short repetition codes, small surface codes and the Steane code. Error correction circuits that are efficient for biased error channels are identified. Using the Steane code, when error channels are biased with a ratio of $10^{-3}$, the logical error rate of $10^{-15}$ can be achiev…
Let $η_0$ be the supremum of those $η$ for which every poly-size quantum circuit can be simulated by another poly-size quantum circuit with gates of fan-in $\leq 2$ that tolerates random noise independently occurring on all wires at the constant rate $η$. Recent fundamental results showing the principal fact $η_0>0$ give estimates like $η_0\geq 10^{-6}-10^{-4}$, whereas the only upper bound known before is $η_0\leq 0.74$. In this note we improve the latter bound to $η_0\leq 1/2$, under the assumption $QP\not\subseteq QNC^1$. More generally, we show that if the decoherence rate $η$ is greater t…
We propose a new quantum circuit for the quantum search problem. The quantum circuit is superior to Grover's algorithm in some realistic cases. The reasons for the superiority are in short as follows: In the quantum circuit proposed in this paper, all the operators except for the oracle can be written as direct products of single-qubit gates. Such separable operators can be executed much faster than multi-particle operators, such as c-NOT gates and Toffoli gates, in many realistic systems. The idea of this quantum circuit is inspired by the Hamiltonian used in the adiabatic quantum computer. I…
We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by invoking the threshold theorem derived for quantum circuit computation. Lower bounds for the threshold in the graph-state model are then obtained from known bounds in the circuit model under the same noise process.
Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily studies of quantum memory[1, 2], an important first step towards quantum computation, where the objective is to increase the lifetime of the encoded quantum information. Additionally, several works have explored the implementation of logical gates[3-5]. In this work we study a next step - fault-tolerantly implementing quantum circuits. We choose the $[[4, 1, 2]]$…
Resource generation and dynamical complexities in open random quantum circuits
Harish-Chandra Research Institute（哈里什-钱德拉研究所）；Homi Bhabha National Institute（霍米·巴巴国立研究所）；Indian Institute of Technology (ISM) Dhanbad（印度理工学院（ISMT）丹巴德分校）
Ouyang et al. proposed an $(n,n)$ threshold quantum secret sharing scheme, where the number of participants is limited to $n=4k+1,k\in Z^+$, and the security evaluation of the scheme was carried out accordingly. In this paper, we propose an $(n,n)$ threshold quantum secret sharing scheme for the number of participants $n$ in any case ( $n\in Z^+$ ). The scheme is based on a quantum circuit, which consists of Clifford group gates and Toffoli gate. We study the properties of the quantum circuit in this paper and use the quantum circuit to analyze the security of the scheme for dishonest particip…
Radiation sensors based on the heating effect of the absorbed radiation are typically relatively simple to operate and flexible in terms of the input frequency. Consequently, they are widely applied, for example, in gas detection, security, THz imaging, astrophysical observations, and medical applications. A new spectrum of important applications is currently emerging from quantum technology and especially from electrical circuits behaving quantum mechanically. This circuit quantum electrodynamics (cQED) has given rise to unprecedented single-photon detectors and a quantum computer supreme to …
Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts. Here, we use ensembles of low-depth random circuits with local connectivity in $D\ge 1$ spatial dimensions to generate quantum error-correcting codes. For random stabilizer codes and the erasure channel, we find strong evidence that a depth $O(\log N)$ random circuit is necessary and sufficient to converge (with high probability) to zero failure probability for any finite amount below the optimal erasure threshold, set by the chann…
The surface code is a many-body quantum system, and simulating it in generic conditions is computationally hard. While the surface code is believed to have a high threshold, the numerical simulations used to establish this threshold are based on simplified noise models. We present a tensor-network algorithm for simulating error correction with the surface code under arbitrary local noise. We use this algorithm to study the threshold and the subthreshold behavior of the amplitude-damping and systematic rotation channels. We also compare these results to those obtained by making standard approxi…
Von Neumann's classic "multiplexing" method is unique in achieving high-threshold fault-tolerant classical computation (FTCC), but has several significant barriers to implementation: i) the extremely complex circuits required by randomized connections, ii) the difficulty of calculating its performance in practical regimes of both code size and logical error rate, and iii) the (perceived) need for large code sizes. Here we present numerical results indicating that the third assertion is false, and introduce a novel scheme that eliminates the two remaining problems while retaining a threshold ve…
Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
Joint Center for Quantum Information & Computer Science, University of Maryland and NIST（马里兰大学与国家标准与技术研究院量子信息与计算机科学联合中心）；Department of Computer Science, University of Maryland（马里兰大学计算机科学系）；Simons Institute for the Theory of Computing, University of California at Berkeley（加州大学伯克利分校西蒙斯计算理论研究所）；National Institute of Standards and Technology (NIST)（国家标准与技术研究院）
Flow to Nishimori universality in weakly monitored quantum circuits with qubit loss
University of Cologne（科隆大学）；University of Geneva（日内瓦大学）；University of California, Santa Barbara（加州大学圣塔芭芭拉分校）；The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））
