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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Finding analytical solution for mirror inverse gate operations in quantum systems with diagonal interactions

Rudrayya Chowdary Garigipati, Preethika Kumar

Published May 21, 2015• 0 citations
Publisher

Abstract

We present an analytical solution for implementing mirror inverse (MI) gate operations directly in quantum systems with diagonal Ising interactions. To achieve this, we use a dynamic learning algorithm as a tool for finding parameters of the system Hamiltonian that realizes the desired MI gate operation directly in systems with fewer qubits. By carefully analyzing the parameter values obtained in these systems, we find analytical solutions that can be extended to calculate parameter values to achieve MI gate operations in systems with larger numbers of qubits without the need for training.

DOI
10.1117/12.2176456

Related papers

Mirror Inverse Operations in Linear Nearest Neighbors Using Dynamic Learning Algorithm

Rudrayya Chowdary Garigipati, Preethika Kumar

We propose a new method to implement mirror inverse gate operations in 1-D linear nearest neighbor (LNN) array coupled through diagonal interactions, using a dynamic learning algorithm. This is accomplished by training a quantum system using a backpropagation technique, to find the parameters of the system Hamiltonian that implement the mirror inverse operation. We show how the training algorithm can be used as a tool for finding the parameters for implementing mirror inverse operations in LNN systems with increasing number of qubits. The key feature of our scheme is that once we find the system parameters using the learning algorithm, mirror inversion (MI) is accomplished simply by tuning the system parameters to these values and allowing the system to evolve for a chosen time interval. To validate our scheme, we compare our results against known results for an LNN system coupled through XY interactions. We also show how the scheme can be used to implement MI operations in the presence of unwanted couplings.

IEEE Transactions on Neural Networks and Learning Systems•Apr 16, 2015•4 citations

Parity-based mirror inversion for efficient quantum state transfer and computation in nearest-neighbor arrays

Preethika Kumar, Sahar Daraeizadeh

We introduce an efficient scheme for quantum state transfer that uses a parity-based mirror inversion technique. We design efficient circuits for implementing mirror inversion in Ising ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}$ and ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}$ coupled systems and show how to analytically solve for system parameters to implement the operation in these systems. The key feature of our scheme is a three-qubit parity gate, which we design as a two-control one-target qubit gate. The parity gate operation is implemented by only varying a single control parameter of the system Hamiltonian and the difficulty of implementing this gate is equivalent to that of a controlled-not gate in a two-qubit system. By applying a sequence of $N+1$ parity-based controlled-unitary operations between nearest-neighbor qubits, where all qubits in an $N$-qubit chain function either as controls or targets, we are able to reverse the order of all qubits along the array. These operations are accomplished by varying only a single control parameter per data qubit. The control parameter depends on the physical system under consideration and on the choice of the designer. Since every qubit participates in the mirror-inversion process functioning either as a control or target, all nearest-neighbor couplings are used. Therefore, we do not need additional measures to cancel the effect of any unwanted interactions and the quantum cost of our scheme does not increase in systems that do not have the ability shut off couplings. Moreover, our scheme does not require additional ancillas, nor does it use a pre-engineered mirror-periodic Hamiltonian to govern the evolution of the system. Using our mirror inversion scheme, we also show how to implement a swap gate between two arbitrary remote qubits, move a block of qubits, and implement efficient computing between two remote qubits in nearest-neighbor layouts.

Physical Review A•Apr 9, 2015•5 citations

Supervised learning of time-independent Hamiltonians for gate design

Luca Innocenti, Leonardo Banchi, Alessandro Ferraro +2 more

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.

arXiv:1803.07119•New Journal of Physics•Apr 17, 2020•40 citations

Quantum gates by inverse engineering of a Hamiltonian

Alan Costa Santos

Abstract Inverse engineering of a Hamiltonian (IEH) from an evolution operator is a useful technique for the protocol of quantum control with potential applications in quantum information processing. In this paper we introduce a particular protocol to perform IEH and we show how this scheme can be used to implement a set of quantum gates by using minimal quantum resources (such as entanglement, interactions between more than two qubits or auxiliary qubits). Remarkably, while previous protocols request three-qubit interactions and/or auxiliary qubits to implement such gates, our protocol requires just two-qubit interactions and no auxiliary qubits. By using this approach we can obtain a large class of Hamiltonians that allow us to implement single and two-qubit gates necessary for quantum computation. To conclude this article we analyze the performance of our scheme against systematic errors related to amplitude noise, where we show that the free parameters introduced in our scheme can be useful for enhancing the robustness of the protocol against such errors.

arXiv:1701.01848•Journal of Physics B Atomic Molecular and Optical Physics•Nov 6, 2017•18 citations

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

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
We present an analytical solution for implementing mirror inverse (MI) gate operations directly in quantum systems with diagonal Ising interactions. To achieve this, we use a dynamic learning algorithm as a tool for finding parameters of the system Hamiltonian that realizes the desired MI gate operation directly in systems with fewer qubits. By carefully analyzing the parameter values obtained in these systems, we find analytical solutions that can be extended to calculate parameter values to achieve MI gate operations in systems with larger numbers of qubits without the need for training.
We propose a new method to implement mirror inverse gate operations in 1-D linear nearest neighbor (LNN) array coupled through diagonal interactions, using a dynamic learning algorithm. This is accomplished by training a quantum system using a backpropagation technique, to find the parameters of the system Hamiltonian that implement the mirror inverse operation. We show how the training algorithm can be used as a tool for finding the parameters for implementing mirror inverse operations in LNN systems with increasing number of qubits. The key feature of our scheme is that once we find the system parameters using the learning algorithm, mirror inversion (MI) is accomplished simply by tuning the system parameters to these values and allowing the system to evolve for a chosen time interval. To validate our scheme, we compare our results against known results for an LNN system coupled through XY interactions. We also show how the scheme can be used to implement MI operations in the presence of unwanted couplings.
We introduce an efficient scheme for quantum state transfer that uses a parity-based mirror inversion technique. We design efficient circuits for implementing mirror inversion in Ising ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}$ and ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}$ coupled systems and show how to analytically solve for system parameters to implement the operation in these systems. The key feature of our scheme is a three-qubit parity gate, which we design as a two-control one-target qubit gate. The parity gate operation is implemented by only varying a single control parameter of the system Hamiltonian and the difficulty of implementing this gate is equivalent to that of a controlled-not gate in a two-qubit system. By applying a sequence of N+1N+1N+1 parity-based controlled-unitary operations between nearest-neighbor qubits, where all qubits in an NNN-qubit chain function either as controls or targets, we are able to reverse the order of all qubits along the array. These operations are accomplished by varying only a single control parameter per data qubit. The control parameter depends on the physical system under consideration and on the choice of the designer. Since every qubit participates in the mirror-inversion process functioning either as a control or target, all nearest-neighbor couplings are used. Therefore, we do not need additional measures to cancel the effect of any unwanted interactions and the quantum cost of our scheme does not increase in systems that do not have the ability shut off couplings. Moreover, our scheme does not require additional ancillas, nor does it use a pre-engineered mirror-periodic Hamiltonian to govern the evolution of the system. Using our mirror inversion scheme, we also show how to implement a swap gate between two arbitrary remote qubits, move a block of qubits, and implement efficient computing between two remote qubits in nearest-neighbor layouts.
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.
Abstract Inverse engineering of a Hamiltonian (IEH) from an evolution operator is a useful technique for the protocol of quantum control with potential applications in quantum information processing. In this paper we introduce a particular protocol to perform IEH and we show how this scheme can be used to implement a set of quantum gates by using minimal quantum resources (such as entanglement, interactions between more than two qubits or auxiliary qubits). Remarkably, while previous protocols request three-qubit interactions and/or auxiliary qubits to implement such gates, our protocol requires just two-qubit interactions and no auxiliary qubits. By using this approach we can obtain a large class of Hamiltonians that allow us to implement single and two-qubit gates necessary for quantum computation. To conclude this article we analyze the performance of our scheme against systematic errors related to amplitude noise, where we show that the free parameters introduced in our scheme can be useful for enhancing the robustness of the protocol against such errors.
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.
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.