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/0611137 · Physical Review A

Minimum-energy pulses for quantum logic cannot be shared

Julio R. Gea-Banacloche, Masanao Ozawa

Published Dec 6, 2006• 14 citations
arXivHTMLPDF

Abstract

We show that if an electromagnetic energy pulse in a multimode coherent state with average photon number $\overline{n}$ is used to carry out the same quantum logical operation on a set of $N$ atoms, either simultaneously or sequentially, the overall error probability in the worst-case scenario (i.e., maximized over all the possible initial atomic states) scales as ${N}^{2}∕\overline{n}$. This means that in order to keep the error probability bounded by $Nϵ$, with $ϵ\ensuremath{\sim}1∕\overline{n}$, one needs to use $N\overline{n}$ photons or, equivalently, $N$ separate ``minimum-energy'' pulses: in this sense the pulses cannot, in general, be shared. The origin of this phenomenon is found in atom-field entanglement. These results may have important consequences for quantum logic and, in particular, for large-scale quantum computation.

DOI
10.1103/physreva.74.060301

Related papers

Minimum energy pulses for quantum logic cannot be shared

Julio R. Gea-Banacloche, Masanao Ozawa

We show that if an electromagnetic pulse with average photon number n is used to carry out the same quantum logical operation on a set of N atoms, the worst-case overall error probability scales as N2/n .

Quantum Electronics and Laser Science Conference•May 1, 2007•1 citation

Energy requirements for quantum computation

Julio R. Gea-Banacloche

A lower bound on the amount of energy needed to carry out an elementary logical operation on a qubit system, with a given accuracy and in a given time, has been recently postulated. This paper is an attempt to formalize this bound and explore the conditions under which it may be expected to hold. For a specific, important case (namely, when the control system is a quantized electromagnetic field) it is shown how one can extend this result to a generally stronger constraint on the minimum energy density required, per pulse.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 9, 2003•2 citations

Rotation errors due to field quantization for simultaneously driven atoms

Hunter Lindemann, Shanon L. Vuglar, Julio R. Gea-Banacloche

When an electromagnetic field in a coherent or quasiclassical (e.g., squeezed) state is used to simultaneously drive an ensemble of two-level atoms, the quantum nature of the field will, in general, cause the final state of the atoms to differ from the one predicted for a totally classical field. This is a potential source of error in quantum logic gates in which the gate is the rotation of the atoms by a laser. In this paper, we use second-order perturbation theory to find how this error scales with the number of atoms, $N$, being driven simultaneously, for an arbitrary rotation angle. The result depends on the initial atomic state: for some highly entangled states, and a field in a coherent state, the error may scale as ${N}^{2}$, yet we find that the average over a random distribution of initial states only scales as $N$. We discuss possible ways to mitigate the error, including the use of squeezed states, as well as adjusting the interaction time between the field and atoms to be different from what would be expected from the classical-field treatment.

arXiv:2508.06769•Physical Review A•Nov 25, 2025•0 citations

Minimum Energy Requirements for Quantum Computation

Julio R. Gea-Banacloche

A lower bound on the amount of energy needed to carry out an elementary logical operation on a quantum computer, with a given accuracy and in a given time, is derived. The bound arises from the requirement that the controls used to manipulate the qubits, which ultimately are themselves quan-tum mechanical systems, must nonetheless be classical to a sufficiently good approximation; it is expected to hold under a wide variety of conditions, and independently of the nature of the physical systems used to encode the qubits. This could have important consequences for very large-scale quantum computations.

Physical Review Letters•Nov 4, 2002•76 citations

Optimal Quantum Driving for Single-Qubit Gates

Joni Ikonen

Quantum computers store and manipulate information in individual quantized energy levels. These devices, not yet realized in their full potential, have the ability to perform certain computational tasks more efficiently than any classical computer. One possible way to implement a quantum computer is to use superconducting circuits controlled by single-mode electromagnetic fields. These circuits constitute the physical quantum bits, or qubits, that are used to store quantum information. A complete, fault-tolerant quantum computer potentially consists of at least millions of physical qubits which are grouped to form fault-tolerant logical qubits. Controlling each physical qubit individually requires a great amount of energy, and hence a future challenge is to reduce the energy consumption in qubit control while maintaining the high precision. In this thesis, we derive a fundamental upper bound for the gate fidelity of a single-qubit not gate implemented with a single resonant driving pulse. It is shown that the upper bound approaches unity inversely proportionally to the increasing mean photon number of the pulse. Furthermore, we find that the upper bound is achieved with an optimal superposition of squeezed states. The typically employed coherent state produces twice as high gate error as the corresponding optimal state. In addition, we present and numerically study a correction protocol that allows using the same drive state for multiple qubit operations. This sustained state is refreshed by sequentially coupling ancillary qubits to it, effectively resetting it and removing entanglement with the previously operated qubits. Thus our protocol allows using the same drive state to implement not gates for different qubits indefinitely, and hence provides a possible route to energy-efficient large-scale quantum computing.

Työväentutkimus Vuosikirja•Jan 1, 2016•0 citations

Achieving minimum-error discrimination of an arbitrary set of laser-light pulses

Marcus Palmer Da Silva, Saikat Guha, Zachary Dutton

Laser light is widely used for communication and sensing applications, so the optimal discrimination of coherent states---the quantum states of light emitted by an ideal laser---has immense practical importance. Due to fundamental limits imposed by quantum mechanics, such discrimination has a finite minimum probability of error. While concrete optical circuits for the optimal discrimination between two coherent states are well known, the generalization to larger sets of coherent states has been challenging. In this paper, we show how to achieve optimal discrimination of any set of coherent states using a resource-efficient quantum computer. Our construction leverages a recent result on discriminating multicopy quantum hypotheses [Blume-Kohout, Croke, and Zwolak, arXiv:1201.6625]. As illustrative examples, we analyze the performance of discriminating a ternary alphabet and show how the quantum circuit of a receiver designed to discriminate a binary alphabet can be reused in discriminating multimode hypotheses. Finally, we show that our result can be used to achieve the quantum limit on the rate of classical information transmission on a lossy optical channel, which is known to exceed the Shannon rate of all conventional optical receivers.

arXiv:1208.5758•Physical Review A•May 23, 2013•34 citations
We show that if an electromagnetic energy pulse in a multimode coherent state with average photon number n‾\overline{n}n is used to carry out the same quantum logical operation on a set of NNN atoms, either simultaneously or sequentially, the overall error probability in the worst-case scenario (i.e., maximized over all the possible initial atomic states) scales as N2∕n‾{N}^{2}∕\overline{n}N2∕n. This means that in order to keep the error probability bounded by NϵNϵNϵ, with ϵ\ensuremath∼1∕n‾ϵ\ensuremath{\sim}1∕\overline{n}ϵ\ensuremath∼1∕n, one needs to use Nn‾N\overline{n}Nn photons or, equivalently, NNN separate ``minimum-energy'' pulses: in this sense the pulses cannot, in general, be shared. The origin of this phenomenon is found in atom-field entanglement. These results may have important consequences for quantum logic and, in particular, for large-scale quantum computation.
A lower bound on the amount of energy needed to carry out an elementary logical operation on a qubit system, with a given accuracy and in a given time, has been recently postulated. This paper is an attempt to formalize this bound and explore the conditions under which it may be expected to hold. For a specific, important case (namely, when the control system is a quantized electromagnetic field) it is shown how one can extend this result to a generally stronger constraint on the minimum energy density required, per pulse.
When an electromagnetic field in a coherent or quasiclassical (e.g., squeezed) state is used to simultaneously drive an ensemble of two-level atoms, the quantum nature of the field will, in general, cause the final state of the atoms to differ from the one predicted for a totally classical field. This is a potential source of error in quantum logic gates in which the gate is the rotation of the atoms by a laser. In this paper, we use second-order perturbation theory to find how this error scales with the number of atoms, NNN, being driven simultaneously, for an arbitrary rotation angle. The result depends on the initial atomic state: for some highly entangled states, and a field in a coherent state, the error may scale as N2{N}^{2}N2, yet we find that the average over a random distribution of initial states only scales as NNN. We discuss possible ways to mitigate the error, including the use of squeezed states, as well as adjusting the interaction time between the field and atoms to be different from what would be expected from the classical-field treatment.
A lower bound on the amount of energy needed to carry out an elementary logical operation on a quantum computer, with a given accuracy and in a given time, is derived. The bound arises from the requirement that the controls used to manipulate the qubits, which ultimately are themselves quan-tum mechanical systems, must nonetheless be classical to a sufficiently good approximation; it is expected to hold under a wide variety of conditions, and independently of the nature of the physical systems used to encode the qubits. This could have important consequences for very large-scale quantum computations.
Quantum computers store and manipulate information in individual quantized energy levels. These devices, not yet realized in their full potential, have the ability to perform certain computational tasks more efficiently than any classical computer. One possible way to implement a quantum computer is to use superconducting circuits controlled by single-mode electromagnetic fields. These circuits constitute the physical quantum bits, or qubits, that are used to store quantum information. A complete, fault-tolerant quantum computer potentially consists of at least millions of physical qubits which are grouped to form fault-tolerant logical qubits. Controlling each physical qubit individually requires a great amount of energy, and hence a future challenge is to reduce the energy consumption in qubit control while maintaining the high precision. In this thesis, we derive a fundamental upper bound for the gate fidelity of a single-qubit not gate implemented with a single resonant driving pulse. It is shown that the upper bound approaches unity inversely proportionally to the increasing mean photon number of the pulse. Furthermore, we find that the upper bound is achieved with an optimal superposition of squeezed states. The typically employed coherent state produces twice as high gate error as the corresponding optimal state. In addition, we present and numerically study a correction protocol that allows using the same drive state for multiple qubit operations. This sustained state is refreshed by sequentially coupling ancillary qubits to it, effectively resetting it and removing entanglement with the previously operated qubits. Thus our protocol allows using the same drive state to implement not gates for different qubits indefinitely, and hence provides a possible route to energy-efficient large-scale quantum computing.
Laser light is widely used for communication and sensing applications, so the optimal discrimination of coherent states---the quantum states of light emitted by an ideal laser---has immense practical importance. Due to fundamental limits imposed by quantum mechanics, such discrimination has a finite minimum probability of error. While concrete optical circuits for the optimal discrimination between two coherent states are well known, the generalization to larger sets of coherent states has been challenging. In this paper, we show how to achieve optimal discrimination of any set of coherent states using a resource-efficient quantum computer. Our construction leverages a recent result on discriminating multicopy quantum hypotheses [Blume-Kohout, Croke, and Zwolak, arXiv:1201.6625]. As illustrative examples, we analyze the performance of discriminating a ternary alphabet and show how the quantum circuit of a receiver designed to discriminate a binary alphabet can be reused in discriminating multimode hypotheses. Finally, we show that our result can be used to achieve the quantum limit on the rate of classical information transmission on a lossy optical channel, which is known to exceed the Shannon rate of all conventional optical receivers.