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

Optimal clock speed of qubit gate operations on open quantum systems

Nilanjana Chanda, Rangeet Bhattacharyya

Published Apr 22, 2020• 11 citations
arXivHTMLPDF

Abstract

Efficient implementation of quantum algorithms requires single- or multiple-qubit gates with high fidelity. Here we report that the fidelity of gate operations on open quantum systems has a maximum value corresponding to an optimum value of the drive amplitude in the presence of drive-induced decoherence. To demonstrate this, we use a previously reported fluctuation-regulated quantum master equation [A. Chakrabarti and R. Bhattacharyya, Phys. Rev. A 97, 063837 (2018)]. The fidelity is found to be a function of the drive-induced dissipative terms as well as the relaxation terms arising from the qubit-environment coupling; as a result, it behaves nonmonotonically with the drive amplitude. The existence of an optimum drive amplitude implies that the qubit gate operations on open quantum systems would have an optimal clock speed. We demonstrate the universality of the results for the gate operations on single- and multiple-qubit gates.

DOI
10.1103/physreva.101.042326

Related papers

Optimal Clock Speed of Single-Qubit Operations

Nilanjana Chanda, Rangeet Bhattacharyya

Efficient implementation of quantum algorithms requires single- or multi-qubit gates with high fidelity. We use a recently reported thermal fluctuation-regulated quantum master equation to estimate the fidelity of single-qubit gates on open quantum systems. We show that the fidelity is a function of the drive-induced dissipative terms as well as the relaxation terms arising from the qubit-environment coupling; as a result, it behaves non-monotonically with the drive-amplitude. The calculated fidelity is found to have a maximum corresponding to an optimum value of the drive-amplitude. Therefore, the highest fidelity of the single-qubit operations on open quantum systems would require an optimal clock speed. The arguments are also extended to multi-qubit systems.

•Aug 1, 2019•0 citations

Efficient transfer of entanglement along a qubit chain in the presence of thermal fluctuations

Gourab Das, Rangeet Bhattacharyya

Quantum communications require efficient implementations of quantum state transportation with high fidelity. Here, we consider the transport of entanglement along a chain of qubits. A series of SWAP operations involving successive pairs of qubits can transport entanglement along the chain. We report that the fidelity of the abovementioned gate has a maximum value corresponding to an optimum value of the drive amplitude in the presence of drive-induced decoherence. To incorporate environmental effect, we use a previously reported fluctuation-regulated quantum master equation [A. Chakrabarti and R. Bhattacharyya, Phys. Rev. A 97, 063837 (2018)]. The existence of an optimum drive amplitude implies that these series of SWAP operations on open quantum systems would have an optimal transfer speed of the entanglement.

arXiv:2201.11666•Jan 27, 2022•0 citations

Optimal fidelity in implementing Grover's search algorithm on open quantum system

Nilanjana Chanda, Rangeet Bhattacharyya

We investigate the fidelity of Grover's search algorithm by implementing it on an open quantum system. In particular, we study with what accuracy one can estimate that the algorithm would deliver the searched state. In reality, every system has some influence of its environment. We include the environmental effects on the system dynamics by using a recently reported fluctuation-regulated quantum master equation (FRQME). The FRQME indicates that in addition to the regular relaxation due to system-environment coupling, the applied drive also causes dissipation in the system dynamics. As a result, the fidelity is found to depend on both the drive-induced dissipative terms and the relaxation terms and we find that there exists a competition between them, leading to an optimum value of the drive amplitude for which the fidelity becomes maximum. For efficient implementation of the search algorithm, precise knowledge of this optimum drive amplitude is essential.

arXiv:2303.01759•Mar 3, 2023•0 citations

Optimal Quantum Driving for Single-Qubit Gates

Joni Ikonen

Quantum computers store and manipulate information in individual quantized energy levels. These devices, not yet realized in their full potential, have the ability to perform certain computational tasks more efficiently than any classical computer. One possible way to implement a quantum computer is to use superconducting circuits controlled by single-mode electromagnetic fields. These circuits constitute the physical quantum bits, or qubits, that are used to store quantum information. A complete, fault-tolerant quantum computer potentially consists of at least millions of physical qubits which are grouped to form fault-tolerant logical qubits. Controlling each physical qubit individually requires a great amount of energy, and hence a future challenge is to reduce the energy consumption in qubit control while maintaining the high precision. In this thesis, we derive a fundamental upper bound for the gate fidelity of a single-qubit not gate implemented with a single resonant driving pulse. It is shown that the upper bound approaches unity inversely proportionally to the increasing mean photon number of the pulse. Furthermore, we find that the upper bound is achieved with an optimal superposition of squeezed states. The typically employed coherent state produces twice as high gate error as the corresponding optimal state. In addition, we present and numerically study a correction protocol that allows using the same drive state for multiple qubit operations. This sustained state is refreshed by sequentially coupling ancillary qubits to it, effectively resetting it and removing entanglement with the previously operated qubits. Thus our protocol allows using the same drive state to implement not gates for different qubits indefinitely, and hence provides a possible route to energy-efficient large-scale quantum computing.

Työväentutkimus Vuosikirja•Jan 1, 2016•0 citations

Impact of decoherence on the fidelity of quantum gates leaving the computational subspace

Tahereh Abad, Yoni Schattner, Anton Frisk Kockum +1 more

The fidelity of quantum operations is often limited by incoherent errors, which typically can be modeled by fundamental Markovian noise processes such as amplitude damping and dephasing. In Phys. Rev. Lett. 129, 150504 (2022), we presented an analytical result for the average gate fidelity of a general multiqubit operation in terms of the dissipative rates and the corresponding Lindblad jump operators, provided that the operation remains in the computational subspace throughout the time evolution. Here we generalize this expression for the average gate fidelity to include the cases where the system state temporarily leaves the computational subspace during the gate. Such gate mechanisms are integral to several quantum-computing platforms, and our formula is applicable to all of them; as examples, we employ it for the two-qubit controlled-Z gate in both superconducting qubits and neutral atoms. We also obtain the average gate fidelity for simultaneous operations applied in multiqubit systems. These results are useful for understanding the error budgets of quantum gates while scaling up quantum computers.

arXiv:2302.13885•Quantum•Apr 3, 2025•18 citations

Robust quantum gates for open systems via optimal control: Markovian versus non-Markovian dynamics

Frederik F. Flöther, Pierre de Fouquieres, S. G. Schirmer

We study the implementation of one-, two- and three-qubit quantum gates for interacting qubits using optimal control. Markovian and non-Markovian environments are compared and efficient optimization algorithms utilizing analytic gradient expressions and quasi-Newton updates are given for both cases. The performance of the algorithms is analysed for a large set of problems in terms of the fidelities attained and the observed convergence behaviour. New notions of success rate and success speed are introduced and density plots are utilized to study the effects of key parameters, such as gate operation times, and random variables such as the initial fields required to start the iterative algorithm. Core characteristics of the optimal fields are analysed statistically. Substantial differences between Markovian and non-Markovian environments in terms of the possibilities for control and the control mechanisms are uncovered. In the non-Markovian case, gate fidelities improve substantially when the details of the system bath coupling are taken into account, although imperfections such as field leakage can be a significant problem. In the Markovian case, computation time is saved if the fields are pre-optimized neglecting the environment, while including the latter generally does not significantly improve gate fidelities.

arXiv:1107.4358•New Journal of Physics•Jul 11, 2012•81 citations
Efficient implementation of quantum algorithms requires single- or multiple-qubit gates with high fidelity. Here we report that the fidelity of gate operations on open quantum systems has a maximum value corresponding to an optimum value of the drive amplitude in the presence of drive-induced decoherence. To demonstrate this, we use a previously reported fluctuation-regulated quantum master equation [A. Chakrabarti and R. Bhattacharyya, Phys. Rev. A 97, 063837 (2018)]. The fidelity is found to be a function of the drive-induced dissipative terms as well as the relaxation terms arising from the qubit-environment coupling; as a result, it behaves nonmonotonically with the drive amplitude. The existence of an optimum drive amplitude implies that the qubit gate operations on open quantum systems would have an optimal clock speed. We demonstrate the universality of the results for the gate operations on single- and multiple-qubit gates.
Efficient implementation of quantum algorithms requires single- or multi-qubit gates with high fidelity. We use a recently reported thermal fluctuation-regulated quantum master equation to estimate the fidelity of single-qubit gates on open quantum systems. We show that the fidelity is a function of the drive-induced dissipative terms as well as the relaxation terms arising from the qubit-environment coupling; as a result, it behaves non-monotonically with the drive-amplitude. The calculated fidelity is found to have a maximum corresponding to an optimum value of the drive-amplitude. Therefore, the highest fidelity of the single-qubit operations on open quantum systems would require an optimal clock speed. The arguments are also extended to multi-qubit systems.
Quantum communications require efficient implementations of quantum state transportation with high fidelity. Here, we consider the transport of entanglement along a chain of qubits. A series of SWAP operations involving successive pairs of qubits can transport entanglement along the chain. We report that the fidelity of the abovementioned gate has a maximum value corresponding to an optimum value of the drive amplitude in the presence of drive-induced decoherence. To incorporate environmental effect, we use a previously reported fluctuation-regulated quantum master equation [A. Chakrabarti and R. Bhattacharyya, Phys. Rev. A 97, 063837 (2018)]. The existence of an optimum drive amplitude implies that these series of SWAP operations on open quantum systems would have an optimal transfer speed of the entanglement.
We investigate the fidelity of Grover's search algorithm by implementing it on an open quantum system. In particular, we study with what accuracy one can estimate that the algorithm would deliver the searched state. In reality, every system has some influence of its environment. We include the environmental effects on the system dynamics by using a recently reported fluctuation-regulated quantum master equation (FRQME). The FRQME indicates that in addition to the regular relaxation due to system-environment coupling, the applied drive also causes dissipation in the system dynamics. As a result, the fidelity is found to depend on both the drive-induced dissipative terms and the relaxation terms and we find that there exists a competition between them, leading to an optimum value of the drive amplitude for which the fidelity becomes maximum. For efficient implementation of the search algorithm, precise knowledge of this optimum drive amplitude is essential.
Quantum computers store and manipulate information in individual quantized energy levels. These devices, not yet realized in their full potential, have the ability to perform certain computational tasks more efficiently than any classical computer. One possible way to implement a quantum computer is to use superconducting circuits controlled by single-mode electromagnetic fields. These circuits constitute the physical quantum bits, or qubits, that are used to store quantum information. A complete, fault-tolerant quantum computer potentially consists of at least millions of physical qubits which are grouped to form fault-tolerant logical qubits. Controlling each physical qubit individually requires a great amount of energy, and hence a future challenge is to reduce the energy consumption in qubit control while maintaining the high precision. In this thesis, we derive a fundamental upper bound for the gate fidelity of a single-qubit not gate implemented with a single resonant driving pulse. It is shown that the upper bound approaches unity inversely proportionally to the increasing mean photon number of the pulse. Furthermore, we find that the upper bound is achieved with an optimal superposition of squeezed states. The typically employed coherent state produces twice as high gate error as the corresponding optimal state. In addition, we present and numerically study a correction protocol that allows using the same drive state for multiple qubit operations. This sustained state is refreshed by sequentially coupling ancillary qubits to it, effectively resetting it and removing entanglement with the previously operated qubits. Thus our protocol allows using the same drive state to implement not gates for different qubits indefinitely, and hence provides a possible route to energy-efficient large-scale quantum computing.
The fidelity of quantum operations is often limited by incoherent errors, which typically can be modeled by fundamental Markovian noise processes such as amplitude damping and dephasing. In Phys. Rev. Lett. 129, 150504 (2022), we presented an analytical result for the average gate fidelity of a general multiqubit operation in terms of the dissipative rates and the corresponding Lindblad jump operators, provided that the operation remains in the computational subspace throughout the time evolution. Here we generalize this expression for the average gate fidelity to include the cases where the system state temporarily leaves the computational subspace during the gate. Such gate mechanisms are integral to several quantum-computing platforms, and our formula is applicable to all of them; as examples, we employ it for the two-qubit controlled-Z gate in both superconducting qubits and neutral atoms. We also obtain the average gate fidelity for simultaneous operations applied in multiqubit systems. These results are useful for understanding the error budgets of quantum gates while scaling up quantum computers.
We study the implementation of one-, two- and three-qubit quantum gates for interacting qubits using optimal control. Markovian and non-Markovian environments are compared and efficient optimization algorithms utilizing analytic gradient expressions and quasi-Newton updates are given for both cases. The performance of the algorithms is analysed for a large set of problems in terms of the fidelities attained and the observed convergence behaviour. New notions of success rate and success speed are introduced and density plots are utilized to study the effects of key parameters, such as gate operation times, and random variables such as the initial fields required to start the iterative algorithm. Core characteristics of the optimal fields are analysed statistically. Substantial differences between Markovian and non-Markovian environments in terms of the possibilities for control and the control mechanisms are uncovered. In the non-Markovian case, gate fidelities improve substantially when the details of the system bath coupling are taken into account, although imperfections such as field leakage can be a significant problem. In the Markovian case, computation time is saved if the fields are pre-optimized neglecting the environment, while including the latter generally does not significantly improve gate fidelities.