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

Quantum Electronics and Laser Science Conference

Minimum energy pulses for quantum logic cannot be shared

Julio R. Gea-Banacloche, Masanao Ozawa

Published May 1, 2007• 1 citation
Publisher

Abstract

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 .
DOI
10.1109/qels.2007.4431703

Related papers

Minimum-energy pulses for quantum logic cannot be shared

Julio R. Gea-Banacloche, Masanao Ozawa

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.

arXiv:quant-ph/0611137•Physical Review A•Dec 6, 2006•14 citations

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

Simple pulse sequence for quantum logic operations using photon-exchange interactions

J. D. Franson, T. B. Pittman, Jonathan P. Dowling

This paper has been withdrawn by the authors due to an error first noted by M. Lukin.

arXiv:quant-ph/9912121•Dec 30, 1999•6 citations

On Lower Bound of Worst Case Error Probability for Quantum Fingerprinting with Shared Entanglement

Li, Xin, Tian Liu, Peng Han +2 more

This paper discusses properties of quantum fingerprinting with shared entanglement. Under certain restriction of final measurement, a relation is given between unitary operations of two parties. Then, by reducing to spherical coding problem, this paper gives a lower bound of worst case error probability for quantum fingerprinting with shared entanglement, showing a relation between worst case error probability and the amount of entanglement(measured by Schmidt number).

arXiv:quant-ph/0606116•Jun 14, 2006•0 citations

Minimum energy needed to perform a quantum logical gate

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. This is a work in progress and any contributions will be appreciated.

arXiv:quant-ph/0209065•Sep 9, 2002•1 citation

Benchmarking quantum logic operations relative to thresholds for fault tolerance

Akel Hashim, Stefan Seritan, Timothy J Proctor +6 more

Abstract Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.

arXiv:2207.08786•npj Quantum Information•Oct 26, 2023•23 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{\sim}1∕\overline{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.
Abstract Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.