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

IEEE Congress on Evolutionary Computation (CEC)

Towards the Dynamic Learning of an Experimental Entanglement Witness

Elizabeth Behrman, James E. Steck, P. K. Gagnebin, S.R. Skinner

Published Sep 22, 2006• 1 citation
Publisher

Abstract

We present a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which a given measurement corresponds to the desired operation. We apply the method to a system of coupled superconducting quantum interference devices (SQUIDs), and demonstrate learning of the XOR, XNOR, Toffoli, and Fredkin gates. Striking out for more interesting territory, we attempt learning of an entanglement witness for a two qubit system. Simulation shows a reasonably successful mapping of the entanglement at the initial time onto the correlation function at the final time for both pure and mixed states. For pure states this mapping requires knowledge of the phase relation between the parts; however, given that knowledge, this method can be used to measure the entanglement of an unknown state.

DOI
10.1109/cec.2006.1688635

Related papers

Quantum algorithm design using dynamic learning

Elizabeth Behrman, James E. Steck, Preethika Kumar +1 more

We present a dynamic learning paradigm for ``programming'' a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which a given measurement corresponds to the desired operation. This can be thought of as a quantum neural network. We first apply the method to a system of two coupled superconducting quantum interference devices (SQUIDs), and demonstrate learning of both the classical gates XOR and XNOR. Training of the phase produces a gate similar to the CNOT. Striking out for somewhat more interesting territory, we attempt learning of an entanglement witness for a two qubit system. Simulation shows a reasonably successful mapping of the entanglement at the initial time onto the correlation function at the final time for both pure and mixed states. For pure states this mapping requires knowledge of the phase relation between the two parts; however, given that knowledge, this method can be used to measure the entanglement of an otherwise unknown state. The method is easily extended to multiple qubits or to quNits.

arXiv:0808.1558•Quantum Information and Computation•Jan 1, 2008•41 citations

Dynamic learning of pairwise and three-way entanglement

Elizabeth Behrman, James E. Steck

In previous work, we have developed a dynamic learning paradigm for “programming” a general quantum computer. A learning algorithm is used to find a set of parameters for a coupled qubit system such that the system at an initial time evolves at the final time to a state in which a given measurement results in the desired calculation value. This can be thought of as a quantum neural network (QNN). Here, we apply our method to a system of three qubits, and demonstrate training the quantum computer to estimate both pairwise and three-way entanglement of the initial state.

World Congress on Nature and Biologically Inspired Computing (NaBIC)•Oct 1, 2011•8 citations

Dynamic learning of pairwise and three-way entanglement

Elizabeth Behrman, James E. Steck

In previous work, we have developed a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find a set of parameters for a coupled qubit system such that the system at an initial time evolves to a state in which a given measurement results in the desired calculation value. This can be thought of as a quantum neural network (QNN). Here, we apply our method to a system of three qubits, and demonstrate training the quantum computer to estimate both pairwise and three-way entanglement.

arXiv:1106.4254•Jun 21, 2011•1 citation

Multiqubit entanglement of a general input state

Elizabeth Behrman, James E. Steck

Measurement of entanglement remains an important problem for quantum information. We present the design and simulation of an experimental method for an entanglement indicator for a general multiqubit state. The system can be in a pure or a mixed state, and it need not be ``close'' to any particular state. The system contains information about its own entanglement; we use dynamic learning methods to map this information onto a single experimental measurement which is our entanglement indicator. Our method does not require prior state reconstruction or lengthy optimization. An entanglement witness emerges from the learning process, beginning with two-qubit systems, and extrapolating this to three, four, and five qubit systems where the entanglement is not well understood. Our independently learned measures for three-qubit systems compare favorably with known entanglement measures. As the size of the system grows the amount of additional training necessary diminishes, raising hopes for applicability to large computational systems.

arXiv:1108.1955•Quantum Information and Computation•Jan 1, 2013•22 citations

Machine Learning applied to Programming Quantum Computers

James E. Steck, Elizabeth Behrman

We apply machine learning to “program” quantum computers, both in simulation and in experimental hardware. A major difficulty in quantum computing is developing effective algorithms that can be programmed on a quantum device. Our approach is to apply machine learning to learn the quantum computer parameters that will yield the desired computation instead of choosing pre-made quantum gates to do the processing. As a proof of concept, we apply machine learning to a 16 qubit quantum gate computer developed by IBM and to a topological quantum computer by Microsoft. Preliminary results are shown of machine learning results both in software simulation and on the actual IBM quantum hardware. Microsoft results are shown only using their simulation as hardware is still being built. A second demonstration is to then port quantum machine learning to a large SQUID array of 2000 qubits originally designed to solve binary optimization problems via quantum annealing. To demonstrate quantum machine learning on this larger scale, it is programmed via machine learning to anneal to various entangled and partially entangled states; investigating a basic building block of general quantum computing. Simulation results are presented along with a method to demonstrate in hardware on a superconducting flux qubit quantum annealing machine housed at the Quantum Artificial Intelligence Laboratory (QuAIL) at NASA’s Advanced Supercomputing facility. Targeted entangled states are the relatively easy GHZ states, the EPR as well as the more difficult W and other states. Using machine learning instead of programming paves the way to greatly expanding the quantum computing capabilities of quantum computing hardware currently available.

AIAA SciTech Forum•Jan 6, 2019•4 citations

Reverse engineering pairwise entanglement.

Nathan L. Thompson, Nhung H. Nguyen, Elizabeth Behrman +1 more

Designing for medium and large scale quantum computers is not easy. In previous work we have suggested, and developed, the idea of using machine learning techniques to train a quantum system such that the desired process is learned, thus obviating the design difficulty. This works quite well. But it is also of interest to explore what exactly these learned algorithms are. Here, we take a step towards answering that question, by looking at a learned entanglement witness for a two-qubit system, and find its decomposition in terms of elementary quantum gates such as can be implemented on one of the commercially available gate model quantum computer simulators. The learned algorithm generalizes easily to three-, four-, five-, six-, and seven-qubit systems, and we infer a result for mesoscopic N. We successfully implement our witness on Microsoft's Q\#. Our results suggest a fruitful pathway for general quantum computer design.

•Feb 21, 2019•1 citation
We present a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which a given measurement corresponds to the desired operation. We apply the method to a system of coupled superconducting quantum interference devices (SQUIDs), and demonstrate learning of the XOR, XNOR, Toffoli, and Fredkin gates. Striking out for more interesting territory, we attempt learning of an entanglement witness for a two qubit system. Simulation shows a reasonably successful mapping of the entanglement at the initial time onto the correlation function at the final time for both pure and mixed states. For pure states this mapping requires knowledge of the phase relation between the parts; however, given that knowledge, this method can be used to measure the entanglement of an unknown state.
We present a dynamic learning paradigm for ``programming'' a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which a given measurement corresponds to the desired operation. This can be thought of as a quantum neural network. We first apply the method to a system of two coupled superconducting quantum interference devices (SQUIDs), and demonstrate learning of both the classical gates XOR and XNOR. Training of the phase produces a gate similar to the CNOT. Striking out for somewhat more interesting territory, we attempt learning of an entanglement witness for a two qubit system. Simulation shows a reasonably successful mapping of the entanglement at the initial time onto the correlation function at the final time for both pure and mixed states. For pure states this mapping requires knowledge of the phase relation between the two parts; however, given that knowledge, this method can be used to measure the entanglement of an otherwise unknown state. The method is easily extended to multiple qubits or to quNits.
In previous work, we have developed a dynamic learning paradigm for “programming” a general quantum computer. A learning algorithm is used to find a set of parameters for a coupled qubit system such that the system at an initial time evolves at the final time to a state in which a given measurement results in the desired calculation value. This can be thought of as a quantum neural network (QNN). Here, we apply our method to a system of three qubits, and demonstrate training the quantum computer to estimate both pairwise and three-way entanglement of the initial state.
In previous work, we have developed a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find a set of parameters for a coupled qubit system such that the system at an initial time evolves to a state in which a given measurement results in the desired calculation value. This can be thought of as a quantum neural network (QNN). Here, we apply our method to a system of three qubits, and demonstrate training the quantum computer to estimate both pairwise and three-way entanglement.
Measurement of entanglement remains an important problem for quantum information. We present the design and simulation of an experimental method for an entanglement indicator for a general multiqubit state. The system can be in a pure or a mixed state, and it need not be ``close'' to any particular state. The system contains information about its own entanglement; we use dynamic learning methods to map this information onto a single experimental measurement which is our entanglement indicator. Our method does not require prior state reconstruction or lengthy optimization. An entanglement witness emerges from the learning process, beginning with two-qubit systems, and extrapolating this to three, four, and five qubit systems where the entanglement is not well understood. Our independently learned measures for three-qubit systems compare favorably with known entanglement measures. As the size of the system grows the amount of additional training necessary diminishes, raising hopes for applicability to large computational systems.
We apply machine learning to “program” quantum computers, both in simulation and in experimental hardware. A major difficulty in quantum computing is developing effective algorithms that can be programmed on a quantum device. Our approach is to apply machine learning to learn the quantum computer parameters that will yield the desired computation instead of choosing pre-made quantum gates to do the processing. As a proof of concept, we apply machine learning to a 16 qubit quantum gate computer developed by IBM and to a topological quantum computer by Microsoft. Preliminary results are shown of machine learning results both in software simulation and on the actual IBM quantum hardware. Microsoft results are shown only using their simulation as hardware is still being built. A second demonstration is to then port quantum machine learning to a large SQUID array of 2000 qubits originally designed to solve binary optimization problems via quantum annealing. To demonstrate quantum machine learning on this larger scale, it is programmed via machine learning to anneal to various entangled and partially entangled states; investigating a basic building block of general quantum computing. Simulation results are presented along with a method to demonstrate in hardware on a superconducting flux qubit quantum annealing machine housed at the Quantum Artificial Intelligence Laboratory (QuAIL) at NASA’s Advanced Supercomputing facility. Targeted entangled states are the relatively easy GHZ states, the EPR as well as the more difficult W and other states. Using machine learning instead of programming paves the way to greatly expanding the quantum computing capabilities of quantum computing hardware currently available.
Designing for medium and large scale quantum computers is not easy. In previous work we have suggested, and developed, the idea of using machine learning techniques to train a quantum system such that the desired process is learned, thus obviating the design difficulty. This works quite well. But it is also of interest to explore what exactly these learned algorithms are. Here, we take a step towards answering that question, by looking at a learned entanglement witness for a two-qubit system, and find its decomposition in terms of elementary quantum gates such as can be implemented on one of the commercially available gate model quantum computer simulators. The learned algorithm generalizes easily to three-, four-, five-, six-, and seven-qubit systems, and we infer a result for mesoscopic N. We successfully implement our witness on Microsoft's Q\#. Our results suggest a fruitful pathway for general quantum computer design.