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

Zeno-effect computation: Opportunities and challenges

Jesse Berwald, Nicholas Chancellor, Raouf Dridi

Published Apr 28, 2025• 4 citations
arXivHTMLPDF

Abstract

Adiabatic quantum computing has demonstrated how the quantum Zeno effect can be used to construct quantum optimizers. However, much less work has been done to understand how more general Zeno effects could be used in a similar setting. We use a construction based on three-state systems rather than directly in qubits, so that a qubit can remain after projecting out one of the states. We find that our model of computing is able to recover the dynamics of a transverse field Ising model. Several generalizations are possible, but our methods allow for constraints to be implemented nonperturbatively and do not need tunable couplers, unlike simple transverse field implementations. We further discuss how to implement the protocol physically using methods building on stimulated Raman adiabatic passage (STIRAP) protocols for state transfer. We find a substantial challenge that settings defined exclusively by measurement or dissipative Zeno effects do not allow for frustration, and in these settings pathological spectral features arise leading to unfavorable runtime scaling. We discuss methods to overcome this challenge, for example including gain as well as loss as is often done in an optical setting.

DOI
10.1103/physreva.111.042623

Related papers

Grover Speedup from Many Forms of the Zeno Effect

Jesse Berwald, Nicholas Chancellor, Raouf Dridi

It has previously been established that adiabatic quantum computation, operating based on a continuous Zeno effect due to dynamical phases between eigenstates, is able to realise an optimal Grover-like quantum speedup. In other words, is able to solve an unstructured search problem with the same N scaling as Grover's original algorithm. A natural question is whether other manifestations of the Zeno effect can also support an optimal speedup in a physically realistic model (through direct analogue application rather than indirectly by supporting a universal gateset). In this paper we show that they can support such a speedup, whether due to measurement, decoherence, or even decay of the excited state into a computationally useless state. Our results also suggest a wide variety of methods to realise speedup which do not rely on Zeno behaviour. We group these algorithms into three families to facilitate a structured understanding of how speedups can be obtained: one based on phase kicks, containing adiabatic computation and continuous-time quantum walks; one based on dephasing and measurement; and finally one based on destruction of the amplitude within the excited state, for which we are not aware of any previous results. These results suggest that there may be exciting opportunities for new paradigms of analog quantum computing based on these effects.

arXiv:2305.11146•Quantum•Nov 20, 2024•7 citations

Fast CNOT gate via quantum Zeno dynamics

Xiao‐Qiang Shao, Li Chen, Shou Zhang +1 more

Based on the quantum Zeno dynamics, we propose two approaches for directly implementing a CNOT gate in a cavity QED system instead of constructing it from elementary gates. The first approach works in the decoherence-free subspaces (DFS) due to the quantum Zeno effect, which is robust against cavity decay. Based on the first model, we then propose the second approach which takes advantage of stimulated Raman adiabatic passage (STIRAP) with only six pulses; thus it is insensitive to the atomic spontaneous emission. The two schemes are suitable for different decoherence parameters. The strictly numerical simulation shows that the average gate fidelities for the two methods are relatively high.

Journal of Physics B Atomic Molecular and Optical Physics•Jul 31, 2009•39 citations

Quantum Information Processing with Quantum Zeno Many-Body Dynamics

Alex Monràs, Oriol Romero‐Isart

We show how the quantum Zeno effect can be exploited to control quantum many-body dynamics for quantum information and computation purposes. In particular, we consider a one dimensional array of three level systems interacting via a nearest-neighbour interaction. By encoding the qubit on two levels and using simple projective frequent measurements yielding the quantum Zeno effect, we demonstrate how to implement a well defined quantum register, quantum state transfer on demand, universal two-qubit gates and two-qubit parity measurements. Thus, we argue that the main ingredients for universal quantum computation can be achieved in a spin chain with an always-on and constant many-body Hamiltonian. We also show some possible modifications of the initially assumed dynamics in order to create maximally entangled qubit pairs and single qubit gates.

arXiv:0801.1959•Jan 13, 2008•0 citations

Quantum information processing with quantum zeno many-body dynamics

Alex Monràs, Oriol Romero‐Isart

We show how the quantum Zeno effect can be exploited to control quantum many-body dynamics for quantum information and computation purposes. In particular, we consider a one dimensional array of three level systems interacting via a nearest-neighbour interaction. By encoding the qubit on two levels and using simple projective frequent measurements yielding the quantum Zeno effect, we demonstrate how to implement a well defined quantum register, quantum state transfer on demand, universal two-qubit gates and two-qubit parity measurements. Thus, we argue that the main ingredients for universal quantum computation can be achieved in a spin chain with an {\em always-on} and {\em constant} many-body Hamiltonian. We also show some possible modifications of the initially assumed dynamics in order to create maximally entangled qubit pairs and single qubit gates.

Quantum Information and Computation•Mar 1, 2010•1 citation

Optimal Zeno Dragging for Quantum Control: A Shortcut to Zeno with Action-Based Scheduling Optimization

Philippe Lewalle, Yipei Zhang, K. Birgitta Whaley

The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024

arXiv:2311.01631•PRX Quantum•Jun 26, 2024•10 citations

ADIABATIC PROTOCOLS FOR OPERATOR MEASUREMENT BASED ENTANGLEMENT AND QUANTUM COMPUTING

Andrew D. Greentree, Simon J. Devitt, Lloyd C. L. Hollenberg

The generation and exploitation of entangled states has become one of the most important technological challenges of the twenty-first century. In order to reliably generate multi-particle entangled states, one needs controllable two (or more) qubit interactions, and there have been many proposals for suitable systems. We have recently begun investigating adiabatic transfer protocols (Greentree et al. 2004), which are distinguished from conventional, nonadiabatic approaches by their robustness and relative insensitivity to noise. Focussing on the phosphorus in silicon paradigm we have shown how such transport leads to new quasi-2D architectures (Hollenberg et al. 2006), and surprising particle coupling schemes based on operator measurements (Devitt et al. 2005; Greentree et al. 2006), which in turn may lead to efficient mechanisms for syndrome identification in quantum error correction. Here we describe the realisation of these operator measurements more fully based on adiabatic passage of a control particle, highlighting the applicability of our protocols by showing how they can improve the scalability of other implementations. Introduction The pursuit of devices which can exploit quantum coherence is widely seen as one of the most important and challenging tasks facing twenty-first Century Technology. Defined by the use of coherent quantum systems (at their simplest: qubits, two-state systems) such devices enable a range of tasks, from quantum key distribution via single qubits (Bennett and Brassard 1984) or entangled states (Ekert 1991), to protocols for quantum teleportation (Bennett et al. 1993), efficient quantum simulation (Feynmann 1982; Abrams and Lloyd 1997) and factorisation (Shor 1994). At the heart of most such protocols is the exploitation of entanglement, where qubits that have been entangled, in some sense feel an interaction even if space-like separated. In fact, entanglement is a ubiquitous feature of quantum systems: the task for quantum information devices is to generate controlled and isolated entanglement, so that only the desired qubits are entangled with each other, and deleterious entanglement to the environment avoided. Broadly speaking, entanglement can be generated in one of two ways, either by direct interactions between qubits, or by collective measurement of two (or more) particles in particular bases that are, by their very nature, entangled. Such projective measurements are called operator measurements, and a flexible mechanism to realise them forms the basis of this paper. Operator measurements are intimately linked to the concept of quantum error correction (QEC) (Nielsen and Chuang 2000), and as QEC is an extremely important task for quantum computing, it is possible that our schemes may prove extremely useful in future quantum computers (QC). Operator measurements are also compatible with the concept of ‘repeat-until-success’ quantum computing (Lim et al. 2005; Barrett and Kok 2005; Lim et al. 2006) which has potential advantages for QC in realistic settings. Our method for generating operator measurements is based on protocols to transfer particles adiabatically around a quantum network. There are now several different protocols for such spatial adiabatic passage, which are all extensions of the original STIRAP (STImulated Raman Adiabatic Passage) (Vitanov et al. 2001) protocol. Spatial adiabatic passage protocols can be mediated via electromagnetic pulses (Brandes et al. 2001; Siewert et al. 2006), or direct control of wavefunction overlap (Greentree et al. 2004; Eckert et al. 2004; Petrosyan 2006). All such schemes share a common theme, namely that a particular eigenstate, which is in the null space of the Hamiltonian, can be smoothly evolved as a function of time. Such protocols are therefore extremely robust, requiring little regard for timing provided that the adiabaticity criterion (Vitanov et al. 2001) is respected. For concreteness, we will review the MRAP protocol (Multiple Recipient Adiabatic Passage) introduced by us earlier (Devitt et al. 2005; Greentree et al. 2006), and show explicitly how it can be used to mediate operator measurements. We will then comment on some of the implications of this protocol for QC designs, especially when concepts such as defect-tolerance are introduced. Multiple-Recipient Adiabatic Passage Consider a network, defined by four quantum dots that share a single electron, and two attached qubits, as depicted in Fig. 1(a). Employing quantum communication terminology, we suppose that Alice wishes to send a particle (with information encoded in the electronic spin states) to either Bob 1 or Bob 2, or to some arbitrary superposition of the Bobs, Australian Institute of Physics 17th National Congress 2006 – Brisbane, 3-8 December 2006 RiverPhys Paper No. 474 using the network. For clarity we refer to the particle transferred through the network as the bus particle. We label the quantum dots, A (Alice), 1 B (Bob 1), 2 B (Bob 2), C (Central). Also, the Bobs have qubits 1 Q and 2 Q which will be used later. We further assume that each participant has control of the coupling of their quantum dot to the central dot, and we label this coupling Ωα for α = A, B1, B2. With all dots maintained at constant energy, the Hamiltonian for this four dot system (ignoring the spin degree of freedom) is ( ) ( ) ( ) . . 2 2 1 1 c h C B t C B t A C t H B B A + Ω + Ω + Ω = where the couplings are allowed to vary as a function of time (for example by local control of surface gates to modify the barrier potential). The null space of the Hamiltonian above is a two-dimensional space, spanned by the vectors

•Jan 1, 2006•0 citations
Adiabatic quantum computing has demonstrated how the quantum Zeno effect can be used to construct quantum optimizers. However, much less work has been done to understand how more general Zeno effects could be used in a similar setting. We use a construction based on three-state systems rather than directly in qubits, so that a qubit can remain after projecting out one of the states. We find that our model of computing is able to recover the dynamics of a transverse field Ising model. Several generalizations are possible, but our methods allow for constraints to be implemented nonperturbatively and do not need tunable couplers, unlike simple transverse field implementations. We further discuss how to implement the protocol physically using methods building on stimulated Raman adiabatic passage (STIRAP) protocols for state transfer. We find a substantial challenge that settings defined exclusively by measurement or dissipative Zeno effects do not allow for frustration, and in these settings pathological spectral features arise leading to unfavorable runtime scaling. We discuss methods to overcome this challenge, for example including gain as well as loss as is often done in an optical setting.
It has previously been established that adiabatic quantum computation, operating based on a continuous Zeno effect due to dynamical phases between eigenstates, is able to realise an optimal Grover-like quantum speedup. In other words, is able to solve an unstructured search problem with the same N scaling as Grover's original algorithm. A natural question is whether other manifestations of the Zeno effect can also support an optimal speedup in a physically realistic model (through direct analogue application rather than indirectly by supporting a universal gateset). In this paper we show that they can support such a speedup, whether due to measurement, decoherence, or even decay of the excited state into a computationally useless state. Our results also suggest a wide variety of methods to realise speedup which do not rely on Zeno behaviour. We group these algorithms into three families to facilitate a structured understanding of how speedups can be obtained: one based on phase kicks, containing adiabatic computation and continuous-time quantum walks; one based on dephasing and measurement; and finally one based on destruction of the amplitude within the excited state, for which we are not aware of any previous results. These results suggest that there may be exciting opportunities for new paradigms of analog quantum computing based on these effects.
Based on the quantum Zeno dynamics, we propose two approaches for directly implementing a CNOT gate in a cavity QED system instead of constructing it from elementary gates. The first approach works in the decoherence-free subspaces (DFS) due to the quantum Zeno effect, which is robust against cavity decay. Based on the first model, we then propose the second approach which takes advantage of stimulated Raman adiabatic passage (STIRAP) with only six pulses; thus it is insensitive to the atomic spontaneous emission. The two schemes are suitable for different decoherence parameters. The strictly numerical simulation shows that the average gate fidelities for the two methods are relatively high.
We show how the quantum Zeno effect can be exploited to control quantum many-body dynamics for quantum information and computation purposes. In particular, we consider a one dimensional array of three level systems interacting via a nearest-neighbour interaction. By encoding the qubit on two levels and using simple projective frequent measurements yielding the quantum Zeno effect, we demonstrate how to implement a well defined quantum register, quantum state transfer on demand, universal two-qubit gates and two-qubit parity measurements. Thus, we argue that the main ingredients for universal quantum computation can be achieved in a spin chain with an always-on and constant many-body Hamiltonian. We also show some possible modifications of the initially assumed dynamics in order to create maximally entangled qubit pairs and single qubit gates.
We show how the quantum Zeno effect can be exploited to control quantum many-body dynamics for quantum information and computation purposes. In particular, we consider a one dimensional array of three level systems interacting via a nearest-neighbour interaction. By encoding the qubit on two levels and using simple projective frequent measurements yielding the quantum Zeno effect, we demonstrate how to implement a well defined quantum register, quantum state transfer on demand, universal two-qubit gates and two-qubit parity measurements. Thus, we argue that the main ingredients for universal quantum computation can be achieved in a spin chain with an {\em always-on} and {\em constant} many-body Hamiltonian. We also show some possible modifications of the initially assumed dynamics in order to create maximally entangled qubit pairs and single qubit gates.
The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024
The generation and exploitation of entangled states has become one of the most important technological challenges of the twenty-first century. In order to reliably generate multi-particle entangled states, one needs controllable two (or more) qubit interactions, and there have been many proposals for suitable systems. We have recently begun investigating adiabatic transfer protocols (Greentree et al. 2004), which are distinguished from conventional, nonadiabatic approaches by their robustness and relative insensitivity to noise. Focussing on the phosphorus in silicon paradigm we have shown how such transport leads to new quasi-2D architectures (Hollenberg et al. 2006), and surprising particle coupling schemes based on operator measurements (Devitt et al. 2005; Greentree et al. 2006), which in turn may lead to efficient mechanisms for syndrome identification in quantum error correction. Here we describe the realisation of these operator measurements more fully based on adiabatic passage of a control particle, highlighting the applicability of our protocols by showing how they can improve the scalability of other implementations. Introduction The pursuit of devices which can exploit quantum coherence is widely seen as one of the most important and challenging tasks facing twenty-first Century Technology. Defined by the use of coherent quantum systems (at their simplest: qubits, two-state systems) such devices enable a range of tasks, from quantum key distribution via single qubits (Bennett and Brassard 1984) or entangled states (Ekert 1991), to protocols for quantum teleportation (Bennett et al. 1993), efficient quantum simulation (Feynmann 1982; Abrams and Lloyd 1997) and factorisation (Shor 1994). At the heart of most such protocols is the exploitation of entanglement, where qubits that have been entangled, in some sense feel an interaction even if space-like separated. In fact, entanglement is a ubiquitous feature of quantum systems: the task for quantum information devices is to generate controlled and isolated entanglement, so that only the desired qubits are entangled with each other, and deleterious entanglement to the environment avoided. Broadly speaking, entanglement can be generated in one of two ways, either by direct interactions between qubits, or by collective measurement of two (or more) particles in particular bases that are, by their very nature, entangled. Such projective measurements are called operator measurements, and a flexible mechanism to realise them forms the basis of this paper. Operator measurements are intimately linked to the concept of quantum error correction (QEC) (Nielsen and Chuang 2000), and as QEC is an extremely important task for quantum computing, it is possible that our schemes may prove extremely useful in future quantum computers (QC). Operator measurements are also compatible with the concept of ‘repeat-until-success’ quantum computing (Lim et al. 2005; Barrett and Kok 2005; Lim et al. 2006) which has potential advantages for QC in realistic settings. Our method for generating operator measurements is based on protocols to transfer particles adiabatically around a quantum network. There are now several different protocols for such spatial adiabatic passage, which are all extensions of the original STIRAP (STImulated Raman Adiabatic Passage) (Vitanov et al. 2001) protocol. Spatial adiabatic passage protocols can be mediated via electromagnetic pulses (Brandes et al. 2001; Siewert et al. 2006), or direct control of wavefunction overlap (Greentree et al. 2004; Eckert et al. 2004; Petrosyan 2006). All such schemes share a common theme, namely that a particular eigenstate, which is in the null space of the Hamiltonian, can be smoothly evolved as a function of time. Such protocols are therefore extremely robust, requiring little regard for timing provided that the adiabaticity criterion (Vitanov et al. 2001) is respected. For concreteness, we will review the MRAP protocol (Multiple Recipient Adiabatic Passage) introduced by us earlier (Devitt et al. 2005; Greentree et al. 2006), and show explicitly how it can be used to mediate operator measurements. We will then comment on some of the implications of this protocol for QC designs, especially when concepts such as defect-tolerance are introduced. Multiple-Recipient Adiabatic Passage Consider a network, defined by four quantum dots that share a single electron, and two attached qubits, as depicted in Fig. 1(a). Employing quantum communication terminology, we suppose that Alice wishes to send a particle (with information encoded in the electronic spin states) to either Bob 1 or Bob 2, or to some arbitrary superposition of the Bobs, Australian Institute of Physics 17th National Congress 2006 – Brisbane, 3-8 December 2006 RiverPhys Paper No. 474 using the network. For clarity we refer to the particle transferred through the network as the bus particle. We label the quantum dots, A (Alice), 1 B (Bob 1), 2 B (Bob 2), C (Central). Also, the Bobs have qubits 1 Q and 2 Q which will be used later. We further assume that each participant has control of the coupling of their quantum dot to the central dot, and we label this coupling Ωα for α = A, B1, B2. With all dots maintained at constant energy, the Hamiltonian for this four dot system (ignoring the spin degree of freedom) is ( ) ( ) ( ) . . 2 2 1 1 c h C B t C B t A C t H B B A + Ω + Ω + Ω = where the couplings are allowed to vary as a function of time (for example by local control of surface gates to modify the barrier potential). The null space of the Hamiltonian above is a two-dimensional space, spanned by the vectors