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:2306.01223 · Quantum Information Processing

Time optimal qubit computer

P. G. Morrison

Published Dec 29, 2023• 1 citation
arXivHTMLPDF
DOI
10.1007/s11128-023-04209-5

Related papers

Time-optimal Qubit Reset via Environmental Spectral Structure

Hong-Bo Huang, Hui Dong

Fast qubit reset is essential for qubit reuse in the noisy intermediate-scale quantum computing era, yet it conflicts with the weak decoherence required for high-fidelity computation. We solve the time-optimal reset problem for a frequency-tunable qubit coupled to a structural environment under realistic spectral and control constraints. The optimal strategy consists of a switch--restore--switch sequence, where the qubit is moved from a low-decoherence computational configuration to a high-decoherence restoring configuration and then returned for reuse. For superconducting qubits in four representative environments, this strategy reduces the reset time from typically $\gtrsim\SI{100}{\nano\second}$ to $\SI{20}{\nano\second}$, about $40\%$ of a typical two-qubit gate time, while achieving a reset precision of $10^{-5}$. Our results identify environmental spectral structure as a practical resource for rapid, high-fidelity qubit reset and provide a design principle for qubit reuse on qubit-limited processors.

quant-pharXiv:2604.21230•Apr 24, 2026•1 citation

Time Optimization in Quantum Computing

Anonymous

Physics•Oct 19, 2016•0 citations

Quantum Computing with Qubits

Samuel L. Braunstein, Arun Kumar Pati

Springer eBooks•Jan 1, 2003•1 citation

Time complexity and gate complexity

Tatsuhiko Koike, Yosuke Okudaira

We formulate and investigate the simplest version of time-optimal quantum computation theory (TO-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version of TO-QCT is also considered as optimality by sub-Riemannian geodesic length. The work has two aims: One is to develop a TO-QCT itself based on a physically natural concept of time, and the other is to pursue the possibility of using TO-QCT as a tool to estimate the complexity in conventional gate-optimal quantum computation theory (GO-QCT). In particular, we investigate to what extent is true the following statement: Time complexity is polynomial in the number of qubits if and only if gate complexity is also. In the analysis, we relate TO-QCT and optimal control theory (OCT) through fidelity-optimal computation theory (FO-QCT); FO-QCT is equivalent to TO-QCT in the limit of unit optimal fidelity, while it is formally similar to OCT. We then develop an efficient numerical scheme for FO-QCT by modifying Krotov's method in OCT, which has a monotonic convergence property. We implemented the scheme and obtained solutions of FO-QCT and of TO-QCT for the quantum Fourier transform and a unitary operator that does not have an apparent symmetry. The former has a polynomial gate complexity and the latter is expected to have an exponential one which is based on the fact that a series of generic unitary operators has an exponential gate complexity. The time complexity for the former is found to be linear in the number of qubits, which is understood naturally by the existence of an upper bound. The time complexity for the latter is exponential in the number of qubits. Thus, both the targets seem to be examples satisfyng the preceding statement. The typical characteristics of the optimal Hamiltonians are symmetry under time reversal and constancy of one-qubit operation, which are mathematically shown to hold in fairly general situations.

arXiv:0910.5587•Physical Review A•Oct 7, 2010•19 citations

Ab initioapproach to the optimization of qubit manipulation

Carlos F. Destefani, Chris McDonald, Ramin Abolfath +2 more

We investigate the multiconfiguration time-dependent Hartree-Fock approach and show that it relaxes computational requirements and makes accurate modeling of few-electron dynamics in nanodevices computationally feasible. The method is applied to the optimization of the manipulation of a two-electron spin-based coded qubit in a double quantum dot and is successfully tested against direct integration of the multidimensional time-dependent Schr\"odinger equation. Our investigation presents a basis for the ab initio optimization of few-qubit operations, which is prohibitively difficult to do with other numerical methods.

Physical Review B•Oct 31, 2008•6 citations

Qubits and Quantum Computers

WORLD SCIENTIFIC eBooks•Jul 9, 2024•0 citations
Fast qubit reset is essential for qubit reuse in the noisy intermediate-scale quantum computing era, yet it conflicts with the weak decoherence required for high-fidelity computation. We solve the time-optimal reset problem for a frequency-tunable qubit coupled to a structural environment under realistic spectral and control constraints. The optimal strategy consists of a switch--restore--switch sequence, where the qubit is moved from a low-decoherence computational configuration to a high-decoherence restoring configuration and then returned for reuse. For superconducting qubits in four representative environments, this strategy reduces the reset time from typically $\gtrsim\SI{100}{\nano\second}$ to $\SI{20}{\nano\second}$, about 40%40\%40% of a typical two-qubit gate time, while achieving a reset precision of 10−510^{-5}10−5. Our results identify environmental spectral structure as a practical resource for rapid, high-fidelity qubit reset and provide a design principle for qubit reuse on qubit-limited processors.
We formulate and investigate the simplest version of time-optimal quantum computation theory (TO-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version of TO-QCT is also considered as optimality by sub-Riemannian geodesic length. The work has two aims: One is to develop a TO-QCT itself based on a physically natural concept of time, and the other is to pursue the possibility of using TO-QCT as a tool to estimate the complexity in conventional gate-optimal quantum computation theory (GO-QCT). In particular, we investigate to what extent is true the following statement: Time complexity is polynomial in the number of qubits if and only if gate complexity is also. In the analysis, we relate TO-QCT and optimal control theory (OCT) through fidelity-optimal computation theory (FO-QCT); FO-QCT is equivalent to TO-QCT in the limit of unit optimal fidelity, while it is formally similar to OCT. We then develop an efficient numerical scheme for FO-QCT by modifying Krotov's method in OCT, which has a monotonic convergence property. We implemented the scheme and obtained solutions of FO-QCT and of TO-QCT for the quantum Fourier transform and a unitary operator that does not have an apparent symmetry. The former has a polynomial gate complexity and the latter is expected to have an exponential one which is based on the fact that a series of generic unitary operators has an exponential gate complexity. The time complexity for the former is found to be linear in the number of qubits, which is understood naturally by the existence of an upper bound. The time complexity for the latter is exponential in the number of qubits. Thus, both the targets seem to be examples satisfyng the preceding statement. The typical characteristics of the optimal Hamiltonians are symmetry under time reversal and constancy of one-qubit operation, which are mathematically shown to hold in fairly general situations.
We investigate the multiconfiguration time-dependent Hartree-Fock approach and show that it relaxes computational requirements and makes accurate modeling of few-electron dynamics in nanodevices computationally feasible. The method is applied to the optimization of the manipulation of a two-electron spin-based coded qubit in a double quantum dot and is successfully tested against direct integration of the multidimensional time-dependent Schr\"odinger equation. Our investigation presents a basis for the ab initio optimization of few-qubit operations, which is prohibitively difficult to do with other numerical methods.