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:2410.00893 · Physical Review A

Quantum trajectory sensing problem and its solution

Zachary E. Chin, Isaac L. Chuang

Published May 28, 2025• 3 citations
arXivHTMLPDF

Abstract

The quantum trajectory sensing problem seeks quantum sensor states which enable the trajectories of incident particles to be distinguished using a single measurement. For an $n$-qubit sensor state to unambiguously discriminate a set of trajectories with a single projective measurement, all post-trajectory output states must be mutually orthogonal; therefore, the ${2}^{n}$ state coefficients must satisfy a system of constraints which is typically very large. Given that this system is generally challenging to solve directly, we introduce a group-theoretic framework which simplifies the criteria for sensor states and exponentially reduces the number of equations and variables involved when the trajectories obey certain symmetries. These simplified criteria yield general families of trajectory sensor states and provide bounds on the particle-sensor interaction strength required for perfect one-shot trajectory discrimination. Furthermore, we establish a link between trajectory sensing and quantum error correction, recognizing their common motivation to identify perturbations using projective measurements. Our sensor states in fact form quantum codes, and conversely, a number of familiar stabilizer codes (such as toric codes) also provide trajectory sensing capabilities. This connection enables noise-resilient trajectory sensing through the concatenation of sensor states with quantum error-correcting codes.

DOI
10.1103/physreva.111.052447

Related papers

Quantum Entanglement Enables Single-Shot Trajectory Sensing for Weakly Interacting Particles

Zachary E. Chin, David R. Leibrandt, Isaac L. Chuang

Sensors for mapping the trajectory of an incoming particle find important utility in experimental high energy physics and searches for dark matter. For a quantum sensing protocol that uses projective measurements on a multiqubit sensor array to infer the trajectory of an incident particle, we establish that entanglement can dramatically reduce the particle-qubit interaction strength θ required for perfect trajectory discrimination. Within an interval of θ above this reduced threshold, any unentangled sensor requires Θ[log(1/ε)] repetitions of the protocol to estimate a previously unknown particle trajectory with ε error probability, whereas an entangled sensor can succeed with zero error in a single shot. Furthermore, entanglement can enhance trajectory sensing in realistic scenarios where θ varies continuously over the sensor qubits, exemplified by a Gaussian-profile laser pulse propagating through an array of atoms.

arXiv:2405.05888•Physical Review Letters•May 28, 2025•5 citations

Ancilla-Free Quantum Error Correction Codes for Quantum Metrology

David Layden, Sisi Zhou, Paola Cappellaro +1 more

Quantum error correction has recently emerged as a tool to enhance quantum sensing under Markovian noise. It works by correcting errors in a sensor while letting a signal imprint on the logical state. This approach typically requires a specialized error-correcting code, as most existing codes correct away both the dominant errors and the signal. To date, however, few such specialized codes are known, among which most require noiseless, controllable ancillas. We show here that such ancillas are not needed when the signal Hamiltonian and the error operators commute, a common limiting type of decoherence in quantum sensors. We give a semidefinite program for finding optimal ancilla-free sensing codes in general, as well as closed-form codes for two common sensing scenarios: qubits undergoing dephasing, and a lossy bosonic mode. Finally, we analyze the sensitivity enhancement offered by the qubit code under arbitrary spatial noise correlations, beyond the ideal limit of orthogonal signal and noise operators.

arXiv:1811.01450•Physical Review Letters•Jan 30, 2019•95 citations

Quantum Error Correction and the Limits of Quantum Metrology

Zhuoran Bao, Daniel F. V. James

Quantum metrology has been making amazing progress in the past decades. It is always in researchers' interest to search for new optimal states that improve parameter estimation. In this paper, we point out a connection between the code's error correcting capacity and its ability to act as a sensor. We backed our claim by providing an example that relates the Absorption emission code to the sensor state for arbitrary state rotation. It is hoped that, in building such a unified theory, one can draw inspiration from error correction to develop promising quantum sensors.

quant-pharXiv:2605.24120•May 26, 2026•0 citations

Quantum error correction and quantum computation

G. Alber, A. Delgado, M. Mussinger

In order to stabilize quantum algorithms against decoherence one has to fulfill two requirements. Firstly, one has to develop an appropriate quantum error correcting code. Secondly, one has to find a set of suitable unitary quantum transformations acting on the physical qubits which preserve the properties of this error correcting quantum code and which allow the implementation of a universal set of quantum gates. This is a challenging task in particular if we restrict ourselves to a limited class of two-particle interactions by which the physical qubits can be controlled. For the special cases of four and six physical qubits we discuss a set of such quantum gates which satisfy these two conditions for the recently developed detected-jump correcting quantum codes [1]. These quantum codes are capable of stabilizing distinguishable qubits against decoherence arising from spontaneous decay processes.

Laser Physics•Jan 1, 2002•0 citations

Dynamic local single-shot checks for toric codes

Yingjia Lin, Abhinav Anand, Kenneth R. Brown

Quantum error correction typically requires repeated syndrome extraction due to measurement noise, which results in substantial time overhead in fault-tolerant computation. Single-shot error correction aims to suppress errors using only one round of syndrome extraction. However, for most codes, it requires high-weight checks, which significantly degrade, and often eliminate, single-shot performance at the circuit level. In this work, we introduce local single-shot checks, where we impose constraints on check weights. Using a dynamic measurement scheme, we show that the number of required measurement rounds can be reduced by a factor determined by this constraint. As an example, we show through numerical simulation that our scheme can improve decoding performance compared to conventional checks when using sliding-window decoding with a reduced window size under circuit-level noise models for toric codes. Our work provides a new direction for constructing checks that can reduce time overhead in large-scale fault-tolerant quantum computation.

quant-pharXiv:2511.20576•Nov 26, 2025•1 citation

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, 2018•0 citations
The quantum trajectory sensing problem seeks quantum sensor states which enable the trajectories of incident particles to be distinguished using a single measurement. For an nnn-qubit sensor state to unambiguously discriminate a set of trajectories with a single projective measurement, all post-trajectory output states must be mutually orthogonal; therefore, the 2n{2}^{n}2n state coefficients must satisfy a system of constraints which is typically very large. Given that this system is generally challenging to solve directly, we introduce a group-theoretic framework which simplifies the criteria for sensor states and exponentially reduces the number of equations and variables involved when the trajectories obey certain symmetries. These simplified criteria yield general families of trajectory sensor states and provide bounds on the particle-sensor interaction strength required for perfect one-shot trajectory discrimination. Furthermore, we establish a link between trajectory sensing and quantum error correction, recognizing their common motivation to identify perturbations using projective measurements. Our sensor states in fact form quantum codes, and conversely, a number of familiar stabilizer codes (such as toric codes) also provide trajectory sensing capabilities. This connection enables noise-resilient trajectory sensing through the concatenation of sensor states with quantum error-correcting codes.
Sensors for mapping the trajectory of an incoming particle find important utility in experimental high energy physics and searches for dark matter. For a quantum sensing protocol that uses projective measurements on a multiqubit sensor array to infer the trajectory of an incident particle, we establish that entanglement can dramatically reduce the particle-qubit interaction strength θ required for perfect trajectory discrimination. Within an interval of θ above this reduced threshold, any unentangled sensor requires Θ[log(1/ε)] repetitions of the protocol to estimate a previously unknown particle trajectory with ε error probability, whereas an entangled sensor can succeed with zero error in a single shot. Furthermore, entanglement can enhance trajectory sensing in realistic scenarios where θ varies continuously over the sensor qubits, exemplified by a Gaussian-profile laser pulse propagating through an array of atoms.
Quantum error correction has recently emerged as a tool to enhance quantum sensing under Markovian noise. It works by correcting errors in a sensor while letting a signal imprint on the logical state. This approach typically requires a specialized error-correcting code, as most existing codes correct away both the dominant errors and the signal. To date, however, few such specialized codes are known, among which most require noiseless, controllable ancillas. We show here that such ancillas are not needed when the signal Hamiltonian and the error operators commute, a common limiting type of decoherence in quantum sensors. We give a semidefinite program for finding optimal ancilla-free sensing codes in general, as well as closed-form codes for two common sensing scenarios: qubits undergoing dephasing, and a lossy bosonic mode. Finally, we analyze the sensitivity enhancement offered by the qubit code under arbitrary spatial noise correlations, beyond the ideal limit of orthogonal signal and noise operators.
Quantum metrology has been making amazing progress in the past decades. It is always in researchers' interest to search for new optimal states that improve parameter estimation. In this paper, we point out a connection between the code's error correcting capacity and its ability to act as a sensor. We backed our claim by providing an example that relates the Absorption emission code to the sensor state for arbitrary state rotation. It is hoped that, in building such a unified theory, one can draw inspiration from error correction to develop promising quantum sensors.
In order to stabilize quantum algorithms against decoherence one has to fulfill two requirements. Firstly, one has to develop an appropriate quantum error correcting code. Secondly, one has to find a set of suitable unitary quantum transformations acting on the physical qubits which preserve the properties of this error correcting quantum code and which allow the implementation of a universal set of quantum gates. This is a challenging task in particular if we restrict ourselves to a limited class of two-particle interactions by which the physical qubits can be controlled. For the special cases of four and six physical qubits we discuss a set of such quantum gates which satisfy these two conditions for the recently developed detected-jump correcting quantum codes [1]. These quantum codes are capable of stabilizing distinguishable qubits against decoherence arising from spontaneous decay processes.
Quantum error correction typically requires repeated syndrome extraction due to measurement noise, which results in substantial time overhead in fault-tolerant computation. Single-shot error correction aims to suppress errors using only one round of syndrome extraction. However, for most codes, it requires high-weight checks, which significantly degrade, and often eliminate, single-shot performance at the circuit level. In this work, we introduce local single-shot checks, where we impose constraints on check weights. Using a dynamic measurement scheme, we show that the number of required measurement rounds can be reduced by a factor determined by this constraint. As an example, we show through numerical simulation that our scheme can improve decoding performance compared to conventional checks when using sliding-window decoding with a reduced window size under circuit-level noise models for toric codes. Our work provides a new direction for constructing checks that can reduce time overhead in large-scale fault-tolerant quantum computation.
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.