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:1803.07119 · New Journal of Physics

Supervised learning of time-independent Hamiltonians for gate design

Luca Innocenti, Leonardo Banchi, Alessandro Ferraro, Sougato Bose, Mauro Paternostro

Published Apr 17, 2020• 40 citations
arXivHTMLPDF

Abstract

Abstract We present a general framework to tackle the problem of finding time-independent dynamics generating target unitary evolutions. We show that this problem is equivalently stated as a set of conditions over the spectrum of the time-independent gate generator, thus translating the task into an inverse eigenvalue problem. We illustrate our methodology by identifying suitable time-independent generators implementing Toffoli and Fredkin gates without the need for ancillae or effective evolutions. We show how the same conditions can be used to solve the problem numerically, via supervised learning techniques. In turn, this allows us to solve problems that are not amenable, in general, to direct analytical solution, providing at the same time a high degree of flexibility over the types of gate-design problems that can be approached. As a significant example, we find generators for the Toffoli gate using only diagonal pairwise interactions, which are easier to implement in some experimental architectures. To showcase the flexibility of the supervised learning approach, we give an example of a non-trivial four-qubit gate that is implementable using only diagonal, pairwise interactions.

DOI
10.1088/1367-2630/ab8aaf

Related papers

Supervised learning of time-independent Hamiltonians for gate design

Luca Innocenti, Leonardo Banchi, Alessandro Ferraro +2 more

We present a general framework to approach the problem of finding time-independent dynamics generating target unitary evolutions. More specifically, given a target unitary gate G over a set of qubits, and a parametrized Hamiltonian of the form H ( λ ) = ∑ i λ i σ i with σi Hermitian operators over the qubits, we want to find a set of values λ0 such that exp ( i H ( λ 0 ) ) = G. We show that this problem is equivalently stated as a set of conditions over the spectrum of H ( λ ), reducing the problem to an inverse eigenvalue problem. We show how to solve this problem in some physically relevant instances, like for example to find time-independent dynamics implementing Toffoli and Fredkin gates without the need for ancillary gates or effective evolutions.

Quantum Information and Measurement (QIM)•Jan 1, 2019•3 citations

Quantum gate learning in qubit networks: Toffoli gate without time-dependent control

Leonardo Banchi, Nicola Pancotti, Sougato Bose

Abstract We put forward a strategy to encode a quantum operation into the unmodulated dynamics of a quantum network without the need for external control pulses, measurements or active feedback. Our optimisation scheme, inspired by supervised machine learning, consists in engineering the pairwise couplings between the network qubits so that the target quantum operation is encoded in the natural reduced dynamics of a network section. The efficacy of the proposed scheme is demonstrated by the finding of uncontrolled four-qubit networks that implement either the Toffoli gate, the Fredkin gate or remote logic operations. The proposed Toffoli gate is stable against imperfections, has a high fidelity for fault-tolerant quantum computation and is fast, being based on the non-equilibrium dynamics.

arXiv:1509.04298•npj Quantum Information•Jul 14, 2016•70 citations

Machine-learning-assisted state and gate engineering for quantum technologies

Luca Innocenti

In this thesis, we discuss applications of machine learning to quantum information science. The interface between these two fields has been the subject of much research, recently, driven by the many successes of machine learning for diverse pattern recognition tasks. The work reported in this Thesis addresses precisely the potential of such an interdisciplinary line of research and illustrates how machine learning provides a valuable add-on to standard techniques used in the context of quantum technologies. Specifically, we will first study the problem of devising time-independent dynamics implementing target quantum operations. This involves a challenging optimisation task, which is hard to tackle with standard numerical tools. We demonstrate how the use of supervised learning algorithms can dramatically speed-up this task. We then consider the tasks of engineering and characterising quantum states in large Hilbert spaces. Motivated by strong experimental reasons, we consider explicitly the embodiment of such multi-dimensional quantum systems provided by the orbital angular momentum and polarisation degrees of freedom of light. We devise a protocol involving quantum walks to implement arbitrary states by only making use of the possibility to couple polarisation and orbital angular momentum through relatively recent technological advances in the field of linear optics. This protocol relies solely on the properties of quantum walk dynamics, and is therefore applicable to different types of architectures. We then present an experimental demonstration of this engineering strategy, and consider the issue of assessing the quality of the states thus generated. We show how different machine learning algorithms, including supervised and unsupervised learning ones, are able to tackle this problem and provide useful information in realistic experimental conditions.

•Oct 1, 2026•0 citations

Supervised quantum gate "teaching" for quantum hardware design

Leonardo Banchi, Nicola Pancotti, Sougato Bose

We show how to train a quantum network of pairwise interacting qubits such that its evolution implements a target quantum algorithm into a given network subset. Our strategy is inspired by supervised learning and is designed to help the physical construction of a quantum computer which operates with minimal external classical control.

arXiv:1607.06146•Jul 20, 2016•2 citations

Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis

Lukas Theißinger, Thore Gerlach, David Berghaus +1 more

Quantum unitary synthesis addresses the problem of translating abstract quantum algorithms into sequences of hardware-executable quantum gates. Solving this task exactly is infeasible in general due to the exponential growth of the underlying combinatorial search space. Existing approaches suffer from misaligned optimization objectives, substantial training costs and limited generalization across different qubit counts. We mitigate these limitations by using supervised learning to approximate the minimum description length of residual unitaries and combining this estimate with stochastic beam search to identify near optimal gate sequences. Our method relies on a lightweight model with zero-shot generalization, substantially reducing training overhead compared to prior baselines. Across multiple benchmarks, we achieve faster wall-clock synthesis times while exceeding state-of-the-art methods in terms of success rate for complex circuits.

quant-pharXiv:2602.15146•Feb 18, 2026•3 citations

Variational Quantum Circuits for Multi-Qubit Gate Automata

Majumder, Arunava, Lewis, Dylan, Jayashankar, Akshaya +2 more

Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a time-independent Hamiltonian that generates a given multi-qubit unitary. In particular, we execute a Variational Quantum Algorithm, whose ansatz is carefully chosen to be a sequence of appropriately parametrized unitaries describing at most two-qubit nearest neighbour interactions, dictating the target unitary. Subsequently, we apply our approach to simulate multi-qubit target gates, with and without stochastic noise. We demonstrate that our strategy allows us to implement a Toffoli gate with sufficiently high fidelity, as compared to the other similar techniques. Our approach is an example of the usage of quantum computing for the design of quantum computers.

arXiv:2209.00139•Aug 31, 2022•1 citation
Abstract We present a general framework to tackle the problem of finding time-independent dynamics generating target unitary evolutions. We show that this problem is equivalently stated as a set of conditions over the spectrum of the time-independent gate generator, thus translating the task into an inverse eigenvalue problem. We illustrate our methodology by identifying suitable time-independent generators implementing Toffoli and Fredkin gates without the need for ancillae or effective evolutions. We show how the same conditions can be used to solve the problem numerically, via supervised learning techniques. In turn, this allows us to solve problems that are not amenable, in general, to direct analytical solution, providing at the same time a high degree of flexibility over the types of gate-design problems that can be approached. As a significant example, we find generators for the Toffoli gate using only diagonal pairwise interactions, which are easier to implement in some experimental architectures. To showcase the flexibility of the supervised learning approach, we give an example of a non-trivial four-qubit gate that is implementable using only diagonal, pairwise interactions.
We present a general framework to approach the problem of finding time-independent dynamics generating target unitary evolutions. More specifically, given a target unitary gate G over a set of qubits, and a parametrized Hamiltonian of the form H ( λ ) = ∑ i λ i σ i with σi Hermitian operators over the qubits, we want to find a set of values λ0 such that exp ( i H ( λ 0 ) ) = G. We show that this problem is equivalently stated as a set of conditions over the spectrum of H ( λ ), reducing the problem to an inverse eigenvalue problem. We show how to solve this problem in some physically relevant instances, like for example to find time-independent dynamics implementing Toffoli and Fredkin gates without the need for ancillary gates or effective evolutions.
Abstract We put forward a strategy to encode a quantum operation into the unmodulated dynamics of a quantum network without the need for external control pulses, measurements or active feedback. Our optimisation scheme, inspired by supervised machine learning, consists in engineering the pairwise couplings between the network qubits so that the target quantum operation is encoded in the natural reduced dynamics of a network section. The efficacy of the proposed scheme is demonstrated by the finding of uncontrolled four-qubit networks that implement either the Toffoli gate, the Fredkin gate or remote logic operations. The proposed Toffoli gate is stable against imperfections, has a high fidelity for fault-tolerant quantum computation and is fast, being based on the non-equilibrium dynamics.
In this thesis, we discuss applications of machine learning to quantum information science. The interface between these two fields has been the subject of much research, recently, driven by the many successes of machine learning for diverse pattern recognition tasks. The work reported in this Thesis addresses precisely the potential of such an interdisciplinary line of research and illustrates how machine learning provides a valuable add-on to standard techniques used in the context of quantum technologies. Specifically, we will first study the problem of devising time-independent dynamics implementing target quantum operations. This involves a challenging optimisation task, which is hard to tackle with standard numerical tools. We demonstrate how the use of supervised learning algorithms can dramatically speed-up this task. We then consider the tasks of engineering and characterising quantum states in large Hilbert spaces. Motivated by strong experimental reasons, we consider explicitly the embodiment of such multi-dimensional quantum systems provided by the orbital angular momentum and polarisation degrees of freedom of light. We devise a protocol involving quantum walks to implement arbitrary states by only making use of the possibility to couple polarisation and orbital angular momentum through relatively recent technological advances in the field of linear optics. This protocol relies solely on the properties of quantum walk dynamics, and is therefore applicable to different types of architectures. We then present an experimental demonstration of this engineering strategy, and consider the issue of assessing the quality of the states thus generated. We show how different machine learning algorithms, including supervised and unsupervised learning ones, are able to tackle this problem and provide useful information in realistic experimental conditions.
Quantum unitary synthesis addresses the problem of translating abstract quantum algorithms into sequences of hardware-executable quantum gates. Solving this task exactly is infeasible in general due to the exponential growth of the underlying combinatorial search space. Existing approaches suffer from misaligned optimization objectives, substantial training costs and limited generalization across different qubit counts. We mitigate these limitations by using supervised learning to approximate the minimum description length of residual unitaries and combining this estimate with stochastic beam search to identify near optimal gate sequences. Our method relies on a lightweight model with zero-shot generalization, substantially reducing training overhead compared to prior baselines. Across multiple benchmarks, we achieve faster wall-clock synthesis times while exceeding state-of-the-art methods in terms of success rate for complex circuits.
Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a time-independent Hamiltonian that generates a given multi-qubit unitary. In particular, we execute a Variational Quantum Algorithm, whose ansatz is carefully chosen to be a sequence of appropriately parametrized unitaries describing at most two-qubit nearest neighbour interactions, dictating the target unitary. Subsequently, we apply our approach to simulate multi-qubit target gates, with and without stochastic noise. We demonstrate that our strategy allows us to implement a Toffoli gate with sufficiently high fidelity, as compared to the other similar techniques. Our approach is an example of the usage of quantum computing for the design of quantum computers.