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:0809.3095 · Journal of Physics A Mathematical and Theoretical

Gate fidelity of arbitrary single-qubit gates constrained by conservation laws

Tokishiro Karasawa, Julio R. Gea-Banacloche, Masanao Ozawa

Published May 14, 2009• 26 citations
arXivHTMLPDF

Abstract

Recent investigations show that conservation laws limit the accuracy of gate operations in quantum computing. The inevitable error under the angular momentum conservation law has been evaluated so far for the CNOT, Hadamard and NOT gates for spin-1/2 qubits, while the SWAP gate has no constraint. Here, we extend the above results to general single-qubit gates. We obtain an upper bound of the gate fidelity of arbitrary single-qubit gates implemented under arbitrary conservation laws, determined by the geometry of the conservation law and the gate operation on the Bloch sphere as well as the size of the ancilla.

DOI
10.1088/1751-8113/42/22/225303

Related papers

QUANTUM PRECISION LIMITS FOR ANY IMPLEMENTATION OF SINGLE QUBIT GATES UNDER CONSERVATION LAWS

Tokishiro Karasawa, Masanao Ozawa, Julio R. Gea-Banacloche +1 more

A quantum gate is implemented by control interactions between qubits and their ancilla system. It has been shown that the control interactions have possibilities to induce the dynamical decoherence on the qubits if an additive conservation law is assumed in the interactions and the ancilla system is finite. This decoherece put the precision limit on the gate, which cannot be removed from the qubit by optimizing the interaction and the initialization of the ancilla system. In this paper, we give the outline of investigating the precision limit which is formulated by the lower bound of the gate infidelity, one minus the squared fidelity, for an arbitrary self-adjoint gate on a single qubit. We show rigorous lower bounds in terms of the variance of the conserved quantity and a simple geometrical relation between the conservation law to be assumed and the gates to be implemented. We also comment on another approach to provide the precision limit for an arbitrary single qubit gate under a conservation law.

International Journal of Quantum Information•Jul 1, 2008•0 citations

Conservation-law-induced quantum limits for physical realizations of the quantum NOT gate

Tokishiro Karasawa, Masanao Ozawa

In recent investigations, it has been found that conservation laws generally lead to precision limits on quantum computing. Lower bounds of the error probability have been obtained for various logic operations from the commutation relation between the noise operator and the conserved quantity or from the recently developed universal uncertainty principle for the noise-disturbance trade-off in general measurements. However, the problem of obtaining the precision limit to realizing the quantum NOT gate has eluded a solution from these approaches. Here, we develop a method for this problem based on analyzing the trace distance between the output state from the realization under consideration and the one from the ideal gate. Using the mathematical apparatus of orthogonal polynomials, we obtain a general lower bound on the error probability for the realization of the quantum NOT gate in terms of the number of qubits in the control system under conservation of the total angular momentum of the computational qubit plus the control system along the direction used to encode the computational basis. The lower bound turns out to be more stringent than one might expect from previous results. Our method is expected to lead to more accurate estimates for physical realizations of various types of quantum computations under conservation laws and to contribute to related problems such as the accuracy of programmable quantum processors.

arXiv:0705.1880•Physical Review A•Mar 19, 2007•20 citations

Conservative Quantum Computing

Masanao Ozawa

The Wigner-Araki-Yanase theorem shows that conservation laws limit the accuracy of measurement. Here, we generalize the argument to show that conservation laws limit the accuracy of quantum logic operations. A rigorous lower bound is obtained of the error probability of any physical realization of the controlled-NOT gate under the constraint that the computational basis is represented by a component of spin, and that physical implementations obey the angular momentum conservation law. The lower bound is shown to be inversely proportional to the number of ancilla qubits or the strength of the external control field.

arXiv:quant-ph/0112179•Physical Review Letters•Jul 16, 2002•78 citations

Bounding quantum gate error rate based on reported average fidelity

Yuval R. Sanders, Joel J. Wallman, Barry C. Sanders

Remarkable experimental advances in quantum computing are exemplified by recent announcements of impressive average gate fidelities exceeding 99.9% for single-qubit gates and 99% for two-qubit gates. Although these high numbers engender optimism that fault-tolerant quantum computing is within reach, the connection of average gate fidelity with fault-tolerance requirements is not direct. Here we use reported average gate fidelity to determine an upper bound on the quantum-gate error rate, which is the appropriate metric for assessing progress towards fault-tolerant quantum computation, and we demonstrate that this bound is asymptotically tight for general noise. Although this bound is unlikely to be saturated by experimental noise, we demonstrate using explicit examples that the bound indicates a realistic deviation between the true error rate and the reported average fidelity. We introduce the Pauli distance as a measure of this deviation, and we show that knowledge of the Pauli distance enables tighter estimates of the error rate of quantum gates.

arXiv:1501.04932•New Journal of Physics•Dec 21, 2015•121 citations

Wigner-Araki-Yanase theorem and the realizability of quantum computing (Mathematical Study of Quantum Dynamical Systems and Its Application to Quantum Computer)

Masanao Ozawa

The Wigner-Araki-Yanase theorem shows that conservation laws limit the accuracy of measurement.Here, we generalize the argument to show that conservation laws limit the accuracy of quantum logic operations.A rigorous lower bound is obtained of the error probability of any physical realization of the controlled-NOT gate under the constraint that the computational basis is represented by a component of spin and that physical implementations obey the angular momentum conservation law.The lower bound is shown to be inversely proportional to the number of ancilla qubits or the strength of the external control field.

数理解析研究所講究録•Jan 1, 2004•0 citations

Benchmarks for approximate CNOTs based on a 17-Qubit Surface Code

Peter, Andreas, Daniel Loss, James R. Wootton

Scalable and fault-tolerant quantum computation will require error correction. This will demand constant measurement of many-qubit observables, implemented using a vast number of CNOT gates. Indeed, practically all operations performed by a fault-tolerant device will be these CNOTs, or equivalent two-qubit controlled operations. It is therefore important to devise benchmarks for these gates that explicitly quantify their effectiveness at this task. Here we develop such benchmarks, and demonstrate their use by applying them to a range of differently implemented controlled gates and a particular quantum error correcting code. Specifically, we consider spin qubits confined to quantum dots that are coupled either directly or via floating gates to implement the minimal 17-qubit instance of the surface code. Our results show that small differences in the gate fidelity can lead to large differences in the performance of the surface code. This shows that gate fidelity is not, in general, a good predictor of code performance.

arXiv:1808.03927•Aug 12, 2018•0 citations
Recent investigations show that conservation laws limit the accuracy of gate operations in quantum computing. The inevitable error under the angular momentum conservation law has been evaluated so far for the CNOT, Hadamard and NOT gates for spin-1/2 qubits, while the SWAP gate has no constraint. Here, we extend the above results to general single-qubit gates. We obtain an upper bound of the gate fidelity of arbitrary single-qubit gates implemented under arbitrary conservation laws, determined by the geometry of the conservation law and the gate operation on the Bloch sphere as well as the size of the ancilla.
A quantum gate is implemented by control interactions between qubits and their ancilla system. It has been shown that the control interactions have possibilities to induce the dynamical decoherence on the qubits if an additive conservation law is assumed in the interactions and the ancilla system is finite. This decoherece put the precision limit on the gate, which cannot be removed from the qubit by optimizing the interaction and the initialization of the ancilla system. In this paper, we give the outline of investigating the precision limit which is formulated by the lower bound of the gate infidelity, one minus the squared fidelity, for an arbitrary self-adjoint gate on a single qubit. We show rigorous lower bounds in terms of the variance of the conserved quantity and a simple geometrical relation between the conservation law to be assumed and the gates to be implemented. We also comment on another approach to provide the precision limit for an arbitrary single qubit gate under a conservation law.
In recent investigations, it has been found that conservation laws generally lead to precision limits on quantum computing. Lower bounds of the error probability have been obtained for various logic operations from the commutation relation between the noise operator and the conserved quantity or from the recently developed universal uncertainty principle for the noise-disturbance trade-off in general measurements. However, the problem of obtaining the precision limit to realizing the quantum NOT gate has eluded a solution from these approaches. Here, we develop a method for this problem based on analyzing the trace distance between the output state from the realization under consideration and the one from the ideal gate. Using the mathematical apparatus of orthogonal polynomials, we obtain a general lower bound on the error probability for the realization of the quantum NOT gate in terms of the number of qubits in the control system under conservation of the total angular momentum of the computational qubit plus the control system along the direction used to encode the computational basis. The lower bound turns out to be more stringent than one might expect from previous results. Our method is expected to lead to more accurate estimates for physical realizations of various types of quantum computations under conservation laws and to contribute to related problems such as the accuracy of programmable quantum processors.
The Wigner-Araki-Yanase theorem shows that conservation laws limit the accuracy of measurement. Here, we generalize the argument to show that conservation laws limit the accuracy of quantum logic operations. A rigorous lower bound is obtained of the error probability of any physical realization of the controlled-NOT gate under the constraint that the computational basis is represented by a component of spin, and that physical implementations obey the angular momentum conservation law. The lower bound is shown to be inversely proportional to the number of ancilla qubits or the strength of the external control field.
Remarkable experimental advances in quantum computing are exemplified by recent announcements of impressive average gate fidelities exceeding 99.9% for single-qubit gates and 99% for two-qubit gates. Although these high numbers engender optimism that fault-tolerant quantum computing is within reach, the connection of average gate fidelity with fault-tolerance requirements is not direct. Here we use reported average gate fidelity to determine an upper bound on the quantum-gate error rate, which is the appropriate metric for assessing progress towards fault-tolerant quantum computation, and we demonstrate that this bound is asymptotically tight for general noise. Although this bound is unlikely to be saturated by experimental noise, we demonstrate using explicit examples that the bound indicates a realistic deviation between the true error rate and the reported average fidelity. We introduce the Pauli distance as a measure of this deviation, and we show that knowledge of the Pauli distance enables tighter estimates of the error rate of quantum gates.
The Wigner-Araki-Yanase theorem shows that conservation laws limit the accuracy of measurement.Here, we generalize the argument to show that conservation laws limit the accuracy of quantum logic operations.A rigorous lower bound is obtained of the error probability of any physical realization of the controlled-NOT gate under the constraint that the computational basis is represented by a component of spin and that physical implementations obey the angular momentum conservation law.The lower bound is shown to be inversely proportional to the number of ancilla qubits or the strength of the external control field.
Scalable and fault-tolerant quantum computation will require error correction. This will demand constant measurement of many-qubit observables, implemented using a vast number of CNOT gates. Indeed, practically all operations performed by a fault-tolerant device will be these CNOTs, or equivalent two-qubit controlled operations. It is therefore important to devise benchmarks for these gates that explicitly quantify their effectiveness at this task. Here we develop such benchmarks, and demonstrate their use by applying them to a range of differently implemented controlled gates and a particular quantum error correcting code. Specifically, we consider spin qubits confined to quantum dots that are coupled either directly or via floating gates to implement the minimal 17-qubit instance of the surface code. Our results show that small differences in the gate fidelity can lead to large differences in the performance of the surface code. This shows that gate fidelity is not, in general, a good predictor of code performance.