Also known as information-theoretic bound · control bandwidth · degrees of freedom · accessible states
A quantum system of \(n\) qubits has a Hilbert space of dimension \(2^n\). Naively, controlling it would need an
exponential number of control parameters and exponentially long pulses. Yet optimal control routinely prepares
many-body states with a few dozen parameters. Control complexity explains why, and asks what resources a control
task really needs: how many parameters, how much bandwidth, how much time, and how much classical information.
The illusion of Hilbert space
Physical dynamics cannot explore all of Hilbert space. States that local, time-dependent Hamiltonians can generate
in a time polynomial in the system size occupy an exponentially small volume of it. The overwhelming majority of
states can only be produced after an exponentially long time [1]. Control problems of physical
interest therefore live on a much smaller manifold than the full space.
How many parameters are needed?
The size of the space of control parameters needed to solve a control problem — for pure states, mixed states or
unitaries — is polynomially bounded by the size of the set of states reachable in polynomial time
[2]. Two consequences:
Few parameters can be enough. If the dynamics has an efficient classical description — for example
one-dimensional, slightly entangled dynamics — the control problem can be solved efficiently to finite precision
[2]. This underlies the success of compact parametrizations such as CRAB and of
tensor-network-based Many-body optimal control.
The dimension of the dynamics sets the cost. The control complexity of a many-body evolution is bounded from
below by the dimension of the manifold that supports it. This makes the role of integrability explicit: conserved
quantities confine the dynamics to smaller manifolds [3]. With partial control of the Hamiltonian, arbitrary many-body evolutions
can even be reversed, in a way much more robust to noise than standard time-reversal procedures
[3].
Simulations of constrained problems tell the same story from the optimizer’s side. The minimum number of controls that
ensures a high yield depends on the number of accessible energy levels [4]. With too few control
variables the landscape develops traps [5]; see Control landscapes.
Bandwidth and time
Time and bandwidth trade off against each other. Lloyd and Montangero give a bound on the minimal time of a control
process for a given control bandwidth, a continuous analogue of the Solovay–Kitaev theorem [2].
Minimal times scale with the inverse of the bandwidth, a scaling that optimization in a basis of Slepian functions
reaches for entangling two-qubit gates [6]. See Quantum speed limits and
Pulse parametrization & constraints.
Noise and information
Control fields carry information, and noise degrades it. Information–time bounds quantify how well a system can be
controlled under arbitrary noise sources. They agree with standard decoherence formulas and predict how the
achievable accuracy scales with the noise, which has been tested numerically with dCRAB
[7]. See Robust & ensemble optimal control and Control of open quantum systems.
Related notions of complexity
Geometric (circuit) complexity. The number of gates needed for a unitary can be cast as a geodesic length in
a suitably weighted geometry on the unitary group [8]; see Geometric & time-optimal control.
Computational complexity. Deciding whether a control task is possible at all is undecidable for digitized
controls on a Turing machine [9]. In the real-number model of computation, the polynomial
formulation of QCPOP makes optimal control computable [10].
Algebraic complexity. The dimension of the dynamical Lie algebra determines whether
gradients of variational circuits vanish exponentially (barren plateaus) [11]. It is a measure of
how “large” the controlled dynamics is; see Variational algorithms & QAOA as control.
Practical lessons
Start with a compact, physically motivated parametrization and add parameters only until fidelity saturates.
If a problem needs an exponential number of parameters, it is probably asking for a state that the dynamics cannot
reach in reasonable time.
Low entanglement in the controlled dynamics is a resource: it makes both simulation and control efficient.
Key papers
S. Lloyd and S. MontangeroInformation Theoretical Analysis of Quantum Optimal ControlPhys. Rev. Lett.113, 010502 (2014)doi
The number of control parameters needed is bounded by the size of the set of states reachable in polynomial time; also gives a bandwidth–time bound and the role of entanglement.
David Poulin, Angie Qarry, Rolando Somma and Frank VerstraeteQuantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert SpacePhys. Rev. Lett.106, 170501 (2011)doi
States reachable by local Hamiltonians in polynomial time fill an exponentially small part of Hilbert space — the "convenient illusion" that makes many-body control tractable.
T. Caneva, A. Silva, R. Fazio, S. Lloyd, T. Calarco and S. MontangeroComplexity of controlling quantum many-body dynamicsPhys. Rev. A89, 042322 (2014)doi
A lower bound on the control complexity of many-body dynamics in terms of the dimension of the manifold supporting it, and the role of integrability.
Matthias M. Müller, Stefano Gherardini, Tommaso Calarco, Simone Montangero and Filippo CarusoInformation theoretical limits for quantum optimal control solutions: error scaling of noisy control channelsSci Rep12, 21405 (2022)doi · arXiv:2006.16113
Information–time bounds for control in the presence of noise, and how the achievable accuracy scales with it.
References
David Poulin, Angie Qarry, Rolando Somma and Frank VerstraeteQuantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert SpacePhys. Rev. Lett.106, 170501 (2011)doi
S. Lloyd and S. MontangeroInformation Theoretical Analysis of Quantum Optimal ControlPhys. Rev. Lett.113, 010502 (2014)doi
T. Caneva, A. Silva, R. Fazio, S. Lloyd, T. Calarco and S. MontangeroComplexity of controlling quantum many-body dynamicsPhys. Rev. A89, 042322 (2014)doi
Katharine W. Moore and Herschel RabitzExploring constrained quantum control landscapesThe Journal of Chemical Physics137, 134113 (2012)doi
Gregory Riviello, Katharine Moore Tibbetts, Constantin Brif, Ruixing Long, Re-Bing Wu, et al.Searching for quantum optimal controls under severe constraintsPhys. Rev. A91, 043401 (2015)doi
Dennis LucarelliQuantum optimal control via gradient ascent in function space and the time-bandwidth quantum speed limitPhys. Rev. A97, 062346 (2018)doi
Matthias M. Müller, Stefano Gherardini, Tommaso Calarco, Simone Montangero and Filippo CarusoInformation theoretical limits for quantum optimal control solutions: error scaling of noisy control channelsSci Rep12, 21405 (2022)doi · arXiv:2006.16113
Michael A. Nielsen, Mark R. Dowling, Mile Gu and Andrew C. DohertyQuantum Computation as GeometryScience311, 1133-1135 (2006)doi
Denys I. Bondar and Alexander N. PechenUncomputability and complexity of quantum controlSci Rep10, 1195 (2020)doi · arXiv:1907.10082
Denys I. Bondar, Llorenç Balada Gaggioli, Georgios Korpas, Jakub Marecek, Jiri Vala and Kurt JacobsGlobally optimal control of quantum dynamicsPhys. Rev. Research7, 043202 (2025)doi · arXiv:2209.05790
Martin Larocca, Piotr Czarnik, Kunal Sharma, Gopikrishnan Muraleedharan, Patrick J. Coles and M. CerezoDiagnosing Barren Plateaus with Tools from Quantum Optimal ControlQuantum6, 824 (2022)doi
Recent papers
12 tracked papers since 2000 are classified
under this topic. See all ·
Feed
Real-time waveform generation supports dynamic quantum circuits without pre-storing complete waveforms for every execution path. However, long-lived distortions in flux-control lines degrade gate fidelity, requiring compensation to account for the actual pulse history. A frequency-domain inversion and time-domain fitting method is proposed for resource-efficient real-time flux distortion compensation. The method fits the reconstructed compensation impulse response with a compact hybrid infinite impulse response (IIR) and finite impulse response (FIR) filter. Look-ahead parallelization enables this filter to process synthesized waveforms at 1.2GSa/s on a field-programmable gate array (FPGA). Two-qubit cross-entropy benchmarking shows that real-time IIR filtering achieves a median controlled-Z Pauli fidelity close to the software-reference value of 99.57%. Numerical analysis and FPGA synthesis indicate approximately logarithmic growth in hardware resource use with compensation timescale. Extending compensation from microsecond to hundred-microsecond timescales increases look-up table (LUT) and digital signal processing (DSP) resource use by only about 14% and 4%, respectively, while maintaining a relative arithmetic error below $10^{-4}$. This work provides a scalable hardware foundation for high-fidelity flux control in dynamic superconducting quantum circuits.
We analyze the complexity of synthesizing random states and unitary operators in a multi-qudit system in two paradigms. In one case, we consider the situation in which we manipulate the system by applying a sequence of one- and two-qudit quantum gates that constitute the elementary, and universal, gate set. The minimum number of gates required to perform the desired operation represents the computational complexity. In the other case, we consider the situation in which we manipulate the physical system using physical fields with optimized control pulses. The minimum time required to perform the desired operation represents the physical complexity. In both cases, we use analytical arguments in combination with optimal-control-theory numerical calculations to determine the complexity of random operations. We show that the computational complexity of random states or unitary operators scales exponentially with the number of qudits. Our numerical results suggest that the physical complexity of preparing random quantum states and unitary operators scales more slowly than the computational complexity. We discuss various implications of our results, especially concerning the relationship between random and pseudorandom states and unitary operators.
Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. This enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.
The ability to control quantum systems is necessary for many applications of quantum technologies ranging from gate generation in quantum computation to NMR and laser control of chemical reactions. In many practical situations, the controlled quantum systems are open, i.e., interacting with the environment. While often influence of the environment is considered as an obstacle for controlling the systems, in some cases it can be exploited as a useful resource. In this note, we briefly review some results on control of open quantum systems using environment as a resource, including control by engineered environments and by non-selective measurements, Turing uncomputability of discrete quantum control, parametrization of Kraus maps by points of the Stiefel manifolds and corresponding Riemanninan optimization, control by dissipation and time-dependent decoherence rates, reachable sets, and incoherent GRAPE (Gradient Ascent Pulse Engineering) -- inGRAPE -- for gradient-based optimization.
We investigate the energy-constrained (EC) diamond norm distance between unitary channels acting on possibly infinite-dimensional quantum systems, and establish a number of results. Firstly, we prove that optimal EC discrimination between two unitary channels does not require the use of any entanglement. Extending a result by Acín, we also show that a finite number of parallel queries suffices to achieve zero error discrimination even in this EC setting. Secondly, we employ EC diamond norms to study a novel type of quantum speed limits, which apply to pairs of quantum dynamical semigroups. We expect these results to be relevant for benchmarking internal dynamics of quantum devices. Thirdly, we establish a version of the Solovay--Kitaev theorem that applies to the group of Gaussian unitaries over a finite number of modes, with the approximation error being measured with respect to the EC diamond norm relative to the photon number Hamiltonian.