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

Bulletin of the American Physical Society

High-fidelity single-shot three-qubit gates via machine learning.

Ehsan Zahedinejad, Joydip Ghosh, Barry C. Sanders

Published Mar 15, 2016• 0 citations
OpenAlex

Related papers

Designing High-Fidelity Single-Shot Three-Qubit Gates: A Machine-Learning Approach

Ehsan Zahedinejad, Joydip Ghosh, Barry C. Sanders

To build a quantum computer, one can simplify the design of multi-qubit elements (logic gates) by treating them as series of well known one- and two-qubit gates---at the price of a slower processor. What if there were a handy means for $d\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}t$ multi-qubit design? The authors show numerically that, under existing experimental constraints, their recently developed SuSSADE scheme can yield three-qubit gates for single-shot entangling operations with fidelity greater than 99.9%. This powerful approach brings us that much closer to a fault-tolerant solid-state quantum computer.

arXiv:1511.08862•Physical Review Applied•Nov 16, 2016•91 citations

High-Accuracy Classification of Single-Qubit Noise via Machine Learning.

Travis L. Scholten

•May 22, 2019•0 citations

Machine Learning of Noise in Single-Qubit Hardware

Travis L. Scholten, Robin Blume-Kohout

Bulletin of the American Physical Society•Mar 5, 2018•0 citations

Machine Learning for Designing Fast Quantum Gates

Ehsan Zahedinejad

Fault-tolerant quantum computing requires encoding the quantum information into logical qubits and performing the quantum information processing in a code-space. Quantum error correction codes, then, can be employed to diagnose and remove the possible errors in the quantum information, thereby avoiding the loss of information. Although a series of single- and two-qubit gates can be employed to construct a quantum error correcting circuit, however this decomposition approach is not practically desirable because it leads to circuits with long operation times. An alternative approach to designing a fast quantum circuit is to design quantum gates that act on a multi-qubit gate. Here I devise quantum control schemes to design high-fidelity single-shot multi-qubit (up to three) quantum gates. Quantum control task is to steer quantum dynamics towards closely realizing specific quantum operation by varying the external control parameters (external field) such that the resultant evolution closely approximates the desired evolution. A set of instructions that determines the control parameters, and hence the effectiveness of the control scheme, is called a policy. Machine learning algorithms can be employed to find successful policies for designing quantum gates. In particular, we employ supervised machine learning techniques to generate these successful policies. Finding successful policies is a feasibility problem for which optimization algorithms can be employed. Greedy algorithms are at the heart of machine learning techniques. They converge faster onto a successful policy and require less-computational resource than non-greedy algorithms. However, there is no guarantee that greedy algorithms succeed to a feasible solution when there exist constraints on i) gate operation time ii) computational resources, and iii) experimental resources. Our results show the failure of standard greedy machine learning algorithms and the superiority of non-greedy machine learning algorithms over greedy ones for designing quantum logic gates, when there exist constraints on the quantum system. We have also observed the failure of existing greedy and non-greedy techniques for designing high-fidelity three-qubit gates. Hence, we devised our machine learning technique called Subspace-Selective Self-adaptive Differential Evolution (SuSSADE). Each three-qubit gate designed by SuSSADE operates as fast as an entangling two-qubit gate under the same experimental constraints.

•Jan 1, 2016•0 citations

Quantum control for high-fidelity multi-qubit gates

Raymond J. Spiteri, Marina Schmidt, Joydip Ghosh +2 more

Quantum control for error correction is critical for the practical use of quantum computers. We address quantum optimal control for single-shot multi-qubit gates by framing it as a feasibility problem for the Hamiltonian model that is then solved with standard global optimization software. Our approach yields faster high-fidelity (>99.99%) single-shot three-qubit-gate control than obtained previously, and it has also enabled us to solve the quantum-control problem for a fast high-fidelity four-qubit gate.

arXiv:1805.03569•New Journal of Physics•Oct 11, 2018•26 citations

Reducing qubit budget in quantum machine learning

Jie Pan

Nature Computational Science•Sep 16, 2021•0 citations
To build a quantum computer, one can simplify the design of multi-qubit elements (logic gates) by treating them as series of well known one- and two-qubit gates---at the price of a slower processor. What if there were a handy means for $d\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}t$ multi-qubit design? The authors show numerically that, under existing experimental constraints, their recently developed SuSSADE scheme can yield three-qubit gates for single-shot entangling operations with fidelity greater than 99.9%. This powerful approach brings us that much closer to a fault-tolerant solid-state quantum computer.
Fault-tolerant quantum computing requires encoding the quantum information into logical qubits and performing the quantum information processing in a code-space. Quantum error correction codes, then, can be employed to diagnose and remove the possible errors in the quantum information, thereby avoiding the loss of information. Although a series of single- and two-qubit gates can be employed to construct a quantum error correcting circuit, however this decomposition approach is not practically desirable because it leads to circuits with long operation times. An alternative approach to designing a fast quantum circuit is to design quantum gates that act on a multi-qubit gate. Here I devise quantum control schemes to design high-fidelity single-shot multi-qubit (up to three) quantum gates. Quantum control task is to steer quantum dynamics towards closely realizing specific quantum operation by varying the external control parameters (external field) such that the resultant evolution closely approximates the desired evolution. A set of instructions that determines the control parameters, and hence the effectiveness of the control scheme, is called a policy. Machine learning algorithms can be employed to find successful policies for designing quantum gates. In particular, we employ supervised machine learning techniques to generate these successful policies. Finding successful policies is a feasibility problem for which optimization algorithms can be employed. Greedy algorithms are at the heart of machine learning techniques. They converge faster onto a successful policy and require less-computational resource than non-greedy algorithms. However, there is no guarantee that greedy algorithms succeed to a feasible solution when there exist constraints on i) gate operation time ii) computational resources, and iii) experimental resources. Our results show the failure of standard greedy machine learning algorithms and the superiority of non-greedy machine learning algorithms over greedy ones for designing quantum logic gates, when there exist constraints on the quantum system. We have also observed the failure of existing greedy and non-greedy techniques for designing high-fidelity three-qubit gates. Hence, we devised our machine learning technique called Subspace-Selective Self-adaptive Differential Evolution (SuSSADE). Each three-qubit gate designed by SuSSADE operates as fast as an entangling two-qubit gate under the same experimental constraints.
Quantum control for error correction is critical for the practical use of quantum computers. We address quantum optimal control for single-shot multi-qubit gates by framing it as a feasibility problem for the Hamiltonian model that is then solved with standard global optimization software. Our approach yields faster high-fidelity (>99.99%) single-shot three-qubit-gate control than obtained previously, and it has also enabled us to solve the quantum-control problem for a fast high-fidelity four-qubit gate.