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

Optical Fiber Communication Conference

Empirical Determination of Bang-Bang Controls

Mark Byrd, Daniel A. Lidar

Published Jan 1, 2001• 0 citations
Publisher

Abstract

We present an algorithmic approach to identifying the set of “bang-bang” control operations used to eliminate decoherence afflicting a quantum computer. Using empirical quantum tomography data only, an optimal set of operations is determined.
DOI
10.1364/icqi.2001.pa39

Related papers

Steering Quantum Dynamics of a Two-Qubit System via Optimal Bang-Bang Control

Juju Hu, Qiang Ke, Yinghua Ji

International Journal of Theoretical Physics•Feb 16, 2018•3 citations

Time optimal bang–bang control for dissipative superconducting N-level quantum systems

Hamza Jirari, HERSCHEL A. RABITZ, Ayoub EL-Amrani

The European Physical Journal B•Aug 1, 2026•0 citations

Empirical determination of dynamical decoupling operations

Mark Byrd, Daniel A. Lidar

Strong and fast ``bang-bang'' (BB) pulses have been recently proposed as a means for reducing decoherence in a quantum system. So far theoretical analysis of the BB technique relied on model Hamiltonians. Here we introduce a method for empirically determining the set of required BB pulses, that relies on quantum process tomography. In this manner an experimenter may tailor his or her BB pulses to the quantum system at hand, without having to assume a model Hamiltonian. In addition, the previous work has been extended to a general noiseless evolution via the stabilizer formalism.

arXiv:quant-ph/0205156•Physical Review A•Jan 30, 2003•54 citations

Decoupling neighboring qubits in quantum computer through bang?bang pulse control

Yong Zhang, Zheng-Wei Zhou, Guang‐Can Guo

Physics Letters A•May 1, 2004•6 citations

Optimal Control for Quantum Optimization of Closed and Open Systems

Lorenzo Campos Venuti, Domenico D’Alessandro, Daniel A. Lidar

Optimization is one of the key applications of quantum computing where a quantum speedup has been an eagerly anticipated outcome. A promising approach to optimization using quantum dynamics is to consider a linear combination $s(t)B+[1\ensuremath{-}s(t)]C$ of two noncommuting Hamiltonians $B$ and $C$, where $C$ encodes the solution to the optimization problem in its ground state, $B$ is a Hamiltonian whose ground state is easy to prepare, and $s(t)\ensuremath{\in}[0,1]$ is the bounded ``switching schedule'' or ``path,'' with $t\ensuremath{\in}[0,{t}_{f}]$. This approach encompasses two of the most widely studied quantum-optimization algorithms: quantum annealing [QA; continuous $s(t)$] and the quantum approximate optimization algorithm [QAOA; piecewise constant $s(t)$]. While it is notoriously difficult to prove a quantum advantage for either algorithm, it is possible to compare and contrast them by finding the optimal $s(t)$. Here we provide a rigorous analysis of this quantum optimal control problem, entirely within the geometric framework of Pontryagin's maximum principle of optimal control theory. We extend earlier results, derived in a purely closed-system setting, to open systems. This is the natural setting for experimental realizations of QA and QAOA. In the closed-system setting it was shown that the optimal solution is a ``bang-anneal-bang'' schedule, with the bangs characterized by $s(t)=0$ and $s(t)=1$ in finite subintervals of $[0,{t}_{f}]$, in particular, $s(0)=0$ and $s({t}_{f})=1$, in contrast to the standard prescription $s(0)=1$ and $s({t}_{f})=0$ of QA. As an example, we prove that for a single spin-$1/2$, the optimal solution in the closed-system setting is the bang-bang schedule, switching midway from $s\ensuremath{\equiv}0$ to $s\ensuremath{\equiv}1$. For finite-dimensional environments and without any approximations we identify sufficient conditions ensuring that either the bang-anneal, anneal-bang, or bang-anneal-bang schedules are optimal, and recover the optimality of $s(0)=0$ and $s({t}_{f})=1$. However, for infinite-dimensional environments and a system described by an adiabatic Redfield master equation we do not recover the bang-type optimal solution. In fact we can only identify conditions under which $s({t}_{f})=1$, and even this result is not recovered in the fully Markovian limit, suggesting that the pure anneal-type schedule is optimal. Our open-system results have implications for the use of experimental quantum-information processors, which are by necessity noisy, and suggest that in this practical sense the optimal schedules for quantum optimization are likely to be continuous.

arXiv:2107.03517•Physical Review Applied•Nov 11, 2021•27 citations

Self-consistent quantum tomography for characterizing super-accurate quantum operations

Takanori Sugiyama, Shinpei Imori, Fuyuhiko Tanaka

Bulletin of the American Physical Society•Mar 7, 2018•0 citations
Strong and fast ``bang-bang'' (BB) pulses have been recently proposed as a means for reducing decoherence in a quantum system. So far theoretical analysis of the BB technique relied on model Hamiltonians. Here we introduce a method for empirically determining the set of required BB pulses, that relies on quantum process tomography. In this manner an experimenter may tailor his or her BB pulses to the quantum system at hand, without having to assume a model Hamiltonian. In addition, the previous work has been extended to a general noiseless evolution via the stabilizer formalism.
Optimization is one of the key applications of quantum computing where a quantum speedup has been an eagerly anticipated outcome. A promising approach to optimization using quantum dynamics is to consider a linear combination $s(t)B+[1\ensuremath{-}s(t)]C$ of two noncommuting Hamiltonians BBB and CCC, where CCC encodes the solution to the optimization problem in its ground state, BBB is a Hamiltonian whose ground state is easy to prepare, and $s(t)\ensuremath{\in}[0,1]$ is the bounded ``switching schedule'' or ``path,'' with $t\ensuremath{\in}[0,{t}_{f}]$. This approach encompasses two of the most widely studied quantum-optimization algorithms: quantum annealing [QA; continuous s(t)s(t)s(t)] and the quantum approximate optimization algorithm [QAOA; piecewise constant s(t)s(t)s(t)]. While it is notoriously difficult to prove a quantum advantage for either algorithm, it is possible to compare and contrast them by finding the optimal s(t)s(t)s(t). Here we provide a rigorous analysis of this quantum optimal control problem, entirely within the geometric framework of Pontryagin's maximum principle of optimal control theory. We extend earlier results, derived in a purely closed-system setting, to open systems. This is the natural setting for experimental realizations of QA and QAOA. In the closed-system setting it was shown that the optimal solution is a ``bang-anneal-bang'' schedule, with the bangs characterized by s(t)=0s(t)=0s(t)=0 and s(t)=1s(t)=1s(t)=1 in finite subintervals of [0,tf][0,{t}_{f}][0,tf​], in particular, s(0)=0s(0)=0s(0)=0 and s(tf)=1s({t}_{f})=1s(tf​)=1, in contrast to the standard prescription s(0)=1s(0)=1s(0)=1 and s(tf)=0s({t}_{f})=0s(tf​)=0 of QA. As an example, we prove that for a single spin-1/21/21/2, the optimal solution in the closed-system setting is the bang-bang schedule, switching midway from $s\ensuremath{\equiv}0$ to $s\ensuremath{\equiv}1$. For finite-dimensional environments and without any approximations we identify sufficient conditions ensuring that either the bang-anneal, anneal-bang, or bang-anneal-bang schedules are optimal, and recover the optimality of s(0)=0s(0)=0s(0)=0 and s(tf)=1s({t}_{f})=1s(tf​)=1. However, for infinite-dimensional environments and a system described by an adiabatic Redfield master equation we do not recover the bang-type optimal solution. In fact we can only identify conditions under which s(tf)=1s({t}_{f})=1s(tf​)=1, and even this result is not recovered in the fully Markovian limit, suggesting that the pure anneal-type schedule is optimal. Our open-system results have implications for the use of experimental quantum-information processors, which are by necessity noisy, and suggest that in this practical sense the optimal schedules for quantum optimization are likely to be continuous.