arXiv:quant-ph/0011005

Polynomial procedure of avoiding multiqubit errors arising due to qubit-qubit interaction

Leonid Evgenevich Fedichkin

Published Nov 1, 2000• 5 citations

Abstract

Recently proposed implementations of quantum computer suffer from unavoidable interaction between quantum bits depending upon data being written in them. Novel procedure of avoiding multiqubit errors arising due to uncontrollable qubit-qubit interaction by using addititonal intermediate qubits is proposed. It is shown that the scheme requires only polynomial increase in number of qubits and algorithmic steps.

DOI: 10.48550/arxiv.quant-ph/0011005

Related papers

Interaction-induced decoherence of solid state quantum computer

Maxim Yanchenko, Leonid Evgenevich Fedichkin

Uncontrollable interaction between qubits can completely destroy coherent state of quantum computer. We study such decoherence processes by numerical simulation of quantum computer operation performer adder algorithm. A polynomial procedure of avoiding such decoherence was also simulated.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEMay 28, 20040 citations

New methods in quantum error correction and fault-tolerant quantum computing

Christopher Chamberland

Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.

Oct 22, 20180 citations

Toward efficient correction of multiqubit measurement errors: pair correlation method

Michael R Geller, Mingyu Sun

Abstract Measurement errors limit the performance of near-term quantum computers and their potential for practical application. However they are partly correctable after a calibration step that requires, for a complete implementation on a register of n qubits, 2 n additional measurements. Here we introduce an approximate but efficient method for multiqubit measurement error characterization and mitigation requiring the classical processing of 2 n × 2 n matrices, but only O (4 k n 2 ) measurements, where k = O (1) is the number of qubits in a correlation volume. We demonstrate and validate the method on an IBM Q processor with registers of 4 and 8 superconducting qubits.

arXiv:2001.09980Quantum Science and TechnologyDec 22, 202063 citations

Quantum error correction with mixed ancilla qubits

Ben Criger, Osama Moussa, Raymond Laflamme

Most quantum error-correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $|0\ensuremath{\rangle}$ which can be used as ancilla qubits to prepare multiqubit logical states. In this Brief Report, we examine the consequences of relaxing this assumption and propose a method to increase the fidelity produced by a given code when the ancilla qubits are initialized in mixed states, using the same number of qubits, at most doubling the number of gates when the recovery operation would already be implemented. The procedure implemented consists of altering the encoding operator to include the inverse of the unitary operation used to correct detected errors after decoding. This augmentation will be especially useful in quantum computing architectures that do not possess projective measurement, such as solid-state NMR quantum information processing.

arXiv:1201.1517Physical Review AApr 20, 201215 citations

Quantum Error Correcting Codes

Mikio Nakahara

It has been shown in the previous chapter that interactions between a quantum system with environment cause undesirable changes in the state of the quantum system. In the case of qubits, they appear as bit-ﬂip and phase-ﬂip errors, for example. To reduce such errors, we must build in some sort of error correcting mechanism in the algorithm.

CRC Press eBooksMar 11, 20080 citations

State preparation by shallow circuits using feed forward

Harry Buhrman, Marten Folkertsma, Bruno Loff +1 more

Fault tolerant quantum computers repetitively apply a four-step procedure: First, perform a few one and two-qubit quantum gates. Second, perform a syndrome measurement on a subset of the qubits. Third, perform fast classical computations to establish if and where errors occurred. And, fourth, correct the errors with a correction step. The next iteration applies the same procedure with new one and two-qubit gates. Even though current error-rates prohibit this procedure to work and fault tolerant quantum computing remains a distant goal, the same procedure can already prove useful today. In this work we make use of this four-step scheme not to carry out fault-tolerant computations, but to enhance short, constant -depth, quantum circuits that perform 1 qubit gates and nearest−neighbor 2 qubit gates.We introduce a new computational model called Local Alternating Quantum Classical Computations (LAQCC) . In this model, qubits are placed in a grid and they can only interact with their direct neighbors; the quantum circuits are of constant depth with intermediate measurements; a classical controller can perform log-depth computations on these intermediate measurement outcomes and control future quantum operations based on the outcome. This model fits naturally between quantum algorithms in the NISQ era and full-fledged fault-tolerant quantum computation. We first prove that any Clifford circuit has an equivalent LAQCC circuit, and that any LAQCC circuit can be simulated by a QNC1 circuit. Next, we conjecture the non-simulatability of LAQCC by showing that LAQCC contains the class of Instantaneous Quantum Polynomial-time circuits. We also show that any LAQCC circuit with polynomial-sized quantum circuits and unbounded classical computations is contained in the class of quantum circuits equipped with post-selection gates with respect to the task of state preparation. We continue by presenting LAQCC implementations of different subroutines, including OR-gates, quantum Fourier transforms and Threshold gates. These subroutines prove vital in constructing three state preparation routines in the main part of this work. Preparing a uniform superposition uses constant-depth arithmetic gates, combined with an exact Grover implementation by Long. For the W -state, we employ a compress-uncompress method to switch between a binary and one-hot encoding. This method extends to the more generalized Dicke-states, the superposition of n -bit strings of Hamming weight k , for k=O(n) , but fails for higher k due to the birthday paradox. We extend this protocol to a protocol that prepares many-body scar states, highly excited states with low entanglement and longer coherence times than states with the same energy density. We present a circuit for preparing Dicke-states for larger k requiring log-depth circuits that maps between the factoradic number system and the combinatorial number system.

arXiv:2307.14840QuantumDec 9, 202435 citations