Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0311152 · International Journal of Quantum Information

ANALYTIC SOLUTIONS FOR QUANTUM LOGIC GATES AND MODELING PULSE ERRORS IN A QUANTUM COMPUTER WITH A HEISENBERG INTERACTION

G. P. Berman, D. I. Kamenev, V. I. Tsifrinovich

Published Jun 1, 2004• 1 citation
arXivHTMLPDF

Abstract

We analyze analytically and numerically quantum logic gates in a one-dimensional spin chain with Heisenberg interaction. Analytic solutions for basic one-qubit gates and swap gate are obtained for a quantum computer based on logical qubits. We calculated the errors caused by imperfect pulses which implement the quantum logic gates. It is numerically demonstrated that the probability error is proportional to ε4, while the phase error is proportional to ε, where ε is the characteristic deviation from the perfect pulse duration.

DOI
10.1142/s0219749904000237

Related papers

Error correction for a spin quantum computer

G. P. Berman, David K Campbell, V. I. Tsifrinovich

The problems of error correction in a spin quantum computer are discussed. For digital processing in the Ising and Heisenberg chains driven by a resonant electromagnetic field, the simple schemes are suggested which provide correction of errors caused by imperfect \ensuremath{\pi} pulses, and prevent the most significant errors caused by the nonresonant action of \ensuremath{\pi} pulses. The probability of error caused by the Heisenberg interaction during the action of \ensuremath{\pi} pulses is estimated. For quantum computations in spin systems a principal opportunity to correct the phase errors, based on Steane's three quantum-bits scheme, is described.

Physical review. B, Condensed matter•Mar 1, 1997•11 citations

Influence of qubit displacements on quantum logic operations in a silicon-based quantum computer with constant interaction

D. I. Kamenev, G. P. Berman, V. I. Tsifrinovich

The errors caused by qubit displacements from their prescribed locations in an ensemble of spin chains are estimated analytically and calculated numerically for a quantum computer based on phosphorus donors in silicon. We show that it is possible to polarize (initialize) the nuclear spins even with displaced qubits by using controlled-NOT gates between the electron and nuclear spins of the same phosphorus atom. However, a controlled-NOT gate between the displaced electron spins is implemented with large error because of the exponential dependence of exchange interaction constant on the distance between the qubits. If quantum computation is implemented on an ensemble of many spin chains, the errors can be small if the number of chains with displaced qubits is small.

arXiv:quant-ph/0609104•Physical Review A•Oct 27, 2006•1 citation

One-Spin Quantum Logic Gates from Exchange Interactions and a Global Magnetic Field

Lian-Ao Wu, Daniel A. Lidar, Mark G. Friesen

It has been widely assumed that one-qubit gates in spin-based quantum computers suffer from severe technical difficulties. We show that one-qubit gates can, in fact, be generated using only modest and presently feasible technological requirements. Our solution uses only global magnetic fields and controllable Heisenberg exchange interactions, thus circumventing the need for single-spin addressing.

arXiv:quant-ph/0310094•Physical Review Letters•Jul 15, 2004•37 citations

MODELING FULL ADDER IN ISING SPIN QUANTUM COMPUTER WITH 1000 QUBITS USING QUANTUM MAPS

D. I. Kamenev, G. P. Berman, Richard B. Kassman +1 more

The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features. (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. (The maximum number of pulses required to add one bit (F-gate) is 15.) (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.

arXiv:quant-ph/0403085•International Journal of Quantum Information•Aug 30, 2004•3 citations

Error-Transparent Quantum Gates for Small Logical Qubit Architectures

Eliot Kapit

One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems from a combination of control errors and random single qubit errors from interaction with the environment. While great strides have been made in mitigating control errors, intrinsic qubit error remains a serious problem that limits gate fidelity in modern qubit architectures. Simultaneously, recent developments of small error-corrected logical qubit devices promise significant increases in logical state lifetime, but translating those improvements into increases in gate fidelity is a complex challenge. In this Letter, we construct protocols for gates on and between small logical qubit devices which inherit the parent device's tolerance to single qubit errors which occur at any time before or during the gate. We consider two such devices, a passive implementation of the three-qubit bit flip code, and the author's own [E. Kapit, Phys. Rev. Lett. 116, 150501 (2016)PRLTAO0031-900710.1103/PhysRevLett.116.150501] very small logical qubit (VSLQ) design, and propose error-tolerant gate sets for both. The effective logical gate error rate in these models displays superlinear error reduction with linear increases in single qubit lifetime, proving that passive error correction is capable of increasing gate fidelity. Using a standard phenomenological noise model for superconducting qubits, we demonstrate a realistic, universal one- and two-qubit gate set for the VSLQ, with error rates an order of magnitude lower than those for same-duration operations on single qubits or pairs of qubits. These developments further suggest that incorporating small logical qubits into a measurement based code could substantially improve code performance.

arXiv:1703.09762•Physical Review Letters•Feb 1, 2018•39 citations

Teleportation in a nuclear spin quantum computer

G. P. Berman, Gustavo V. López, V. I. Tsifrinovich

We present a procedure for quantum teleportation in a nuclear spin quantum computer in which quantum logic gates are implemented by using selective electromagnetic pulses. A sequence of pulses is combined with single-spin measurements in the ${\ensuremath{\sigma}}^{z}$ basis for fast transfer of information in a spin quantum computer. We simulated this procedure for quantum teleportation in a nuclear spin chain with a large number (201) of spins. The systematic errors generated in the process of teleportation due to the non-resonant effects are analyzed in detail. We demonstrate that a $``2\ensuremath{\pi}k''$ method provides a significant reduction of errors.

Physical Review A•Oct 17, 2002•6 citations
We analyze analytically and numerically quantum logic gates in a one-dimensional spin chain with Heisenberg interaction. Analytic solutions for basic one-qubit gates and swap gate are obtained for a quantum computer based on logical qubits. We calculated the errors caused by imperfect pulses which implement the quantum logic gates. It is numerically demonstrated that the probability error is proportional to ε4, while the phase error is proportional to ε, where ε is the characteristic deviation from the perfect pulse duration.
The problems of error correction in a spin quantum computer are discussed. For digital processing in the Ising and Heisenberg chains driven by a resonant electromagnetic field, the simple schemes are suggested which provide correction of errors caused by imperfect \ensuremath{\pi} pulses, and prevent the most significant errors caused by the nonresonant action of \ensuremath{\pi} pulses. The probability of error caused by the Heisenberg interaction during the action of \ensuremath{\pi} pulses is estimated. For quantum computations in spin systems a principal opportunity to correct the phase errors, based on Steane's three quantum-bits scheme, is described.
The errors caused by qubit displacements from their prescribed locations in an ensemble of spin chains are estimated analytically and calculated numerically for a quantum computer based on phosphorus donors in silicon. We show that it is possible to polarize (initialize) the nuclear spins even with displaced qubits by using controlled-NOT gates between the electron and nuclear spins of the same phosphorus atom. However, a controlled-NOT gate between the displaced electron spins is implemented with large error because of the exponential dependence of exchange interaction constant on the distance between the qubits. If quantum computation is implemented on an ensemble of many spin chains, the errors can be small if the number of chains with displaced qubits is small.
The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features. (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. (The maximum number of pulses required to add one bit (F-gate) is 15.) (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.
One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems from a combination of control errors and random single qubit errors from interaction with the environment. While great strides have been made in mitigating control errors, intrinsic qubit error remains a serious problem that limits gate fidelity in modern qubit architectures. Simultaneously, recent developments of small error-corrected logical qubit devices promise significant increases in logical state lifetime, but translating those improvements into increases in gate fidelity is a complex challenge. In this Letter, we construct protocols for gates on and between small logical qubit devices which inherit the parent device's tolerance to single qubit errors which occur at any time before or during the gate. We consider two such devices, a passive implementation of the three-qubit bit flip code, and the author's own [E. Kapit, Phys. Rev. Lett. 116, 150501 (2016)PRLTAO0031-900710.1103/PhysRevLett.116.150501] very small logical qubit (VSLQ) design, and propose error-tolerant gate sets for both. The effective logical gate error rate in these models displays superlinear error reduction with linear increases in single qubit lifetime, proving that passive error correction is capable of increasing gate fidelity. Using a standard phenomenological noise model for superconducting qubits, we demonstrate a realistic, universal one- and two-qubit gate set for the VSLQ, with error rates an order of magnitude lower than those for same-duration operations on single qubits or pairs of qubits. These developments further suggest that incorporating small logical qubits into a measurement based code could substantially improve code performance.
We present a procedure for quantum teleportation in a nuclear spin quantum computer in which quantum logic gates are implemented by using selective electromagnetic pulses. A sequence of pulses is combined with single-spin measurements in the ${\ensuremath{\sigma}}^{z}$ basis for fast transfer of information in a spin quantum computer. We simulated this procedure for quantum teleportation in a nuclear spin chain with a large number (201) of spins. The systematic errors generated in the process of teleportation due to the non-resonant effects are analyzed in detail. We demonstrate that a $``2\ensuremath{\pi}k''$ method provides a significant reduction of errors.