Efficient computation of quantum time-optimal control

• URL: http://arxiv.org/abs/2511.11508v1
• Date: Fri, 14 Nov 2025 17:29:16 GMT
• Title: Efficient computation of quantum time-optimal control
• Authors: Andrei A. Stepanenko, Kseniia S. Chernova, Maxim A. Gorlach,
• Abstract summary: We present an approach to compute time-optimal control of a quantum system which combines quantum brachistochrone and Lax pair techniques.<n>We illustrate our method by finding the fastest way to transfer a single-particle excitation in a nearest-neighbor-coupled infinitely large qubit lattice with the fixed sum of squares of the couplings.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an approach to compute time-optimal control of a quantum system which combines quantum brachistochrone and Lax pair techniques and enables efficient investigation of large-scale quantum systems. We illustrate our method by finding the fastest way to transfer a single-particle excitation in a nearest-neighbor-coupled infinitely large qubit lattice with the fixed sum of squares of the couplings.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Efficient Algorithms for Weakly-Interacting Quantum Spin Systems [0.0]
  We find efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature.<n>In particular, we obtain a fully establish-time approximation scheme for the partition function.<n>Our approach is based on the cluster expansion method and a standard reduction from approximate sampling to approximate counting.
  arXiv  Detail & Related papers  (2026-01-29T00:49:31Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Optimal Control by Variational Quantum Algorithms [0.0]
  We introduce a general metric termed control optimality, which accounts for constraints on both classical and quantum components.<n>We discuss the emergent gradient behavior and error robustness, demonstrating the feasibility of applying hybrid quantum algorithms to solve quantum optimal control problems.
  arXiv  Detail & Related papers  (2025-05-29T11:55:37Z)
• Time-optimal transfer of the quantum state in long qubit arrays [0.0]
  We investigate a model problem of quantum state transfer in a large nearest-neighbor-coupled qubit array.<n>We derive an optimal control that simultaneously enables maximal fidelity and minimal time of the transfer.
  arXiv  Detail & Related papers  (2025-01-21T07:11:58Z)
• Genuine Multipartite Entanglement in Quantum Optimization [0.3495246564946556]
  We show that multipartite entanglement provides an upper bound to the overlap of the instantaneous state with an exact solution.<n>Our results help to shed light on how complex quantum correlations come to bear as a resource in quantum optimization.
  arXiv  Detail & Related papers  (2024-11-12T19:00:16Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint-state method together with reverse-time backpropagation to solve prohibitively large open-system quantum control problems.<n>We apply this framework to optimize two inherently dissipative operations in superconducting qubits.<n>Our results show that while standard pulses for dispersive readout are nearly optimal, adding a transmon drive during the protocol can yield 2x improvements in fidelity and duration.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.