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

Physical Review A

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

Preethika Kumar, Sahar Daraeizadeh

Published Apr 9, 2015• 5 citations
Publisher

Abstract

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.

DOI
10.1103/physreva.91.042310

Related papers

Universal quantum computing in linear nearest neighbor architectures

Preethika Kumar, Steven R. Skinner

We introduce a scheme for realizing universal quantum computing in a linear nearest neighbor architecture with fixed couplings. We first show how to realize a controlled-NOT gate operation between two adjacent qubits without having to isolate the two qubits from qubits adjacent to them. The gate operation is implemented by applying two consecutive pulses of equal duration, but varying amplitudes, on the target qubit. Since only a single control parameter is required in implementing our scheme, it is very efficient. We next show how our scheme can be used to realize single qubit rotations and two-qubit controlled-unitary operations. As most proposals for solid state implementations of a quantum computer use a one-dimensional line of qubits, the schemes presented here will be extremely useful.

Quantum Information and Computation•Mar 1, 2011•6 citations

Schemes for parallel quantum computation without local control of qubits

Simon C. Benjamin

Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally applied transformations. Here we demonstrate the minimum physical requirements for such an approach: a one-dimensional array composed of two alternating ``types'' of two-state system. Each system need be sensitive only to the net state of its nearest neighbors, i.e. the number in state $``\ensuremath{\uparrow}''$ minus the number in $``\ensuremath{\downarrow}.''$ Additionally, we show that all such arrays can perform quite general parallel operations. A broad range of physical systems and interactions is suitable: we highlight two examples.

arXiv:quant-ph/9909007•Physical Review A•Jan 18, 2000•88 citations

Efficient implementation of multi-control Toffoli gates in linear nearest neighbor arrays

Saman Daraeizadeh

Most promising implementations in quantum computing are based on Linear Nearest Neighbor (LNN) architectures, where qubits only interact with neighbors. Multi-control Toffoli gates are used in many quantum applications such as error correction and algorithms like Shor's factorization. Typically, to implement a multi-control Toffoli gate in an LNN architecture, additional operations called swap gates are required to bring the qubits adjacent to each other. This may increase the total number of quantum gates and computational overhead of the circuit. Here, we propose a new method to implement multi-control Toffoli gates in LNN arrays without using swap gates. The circuit reduction techniques discussed here are based on 3 lemmas. Using the lemmas, we show how to implement multi-control Toffoli gates in LNN arrays with different separations between the control and target qubits. The key feature of our scheme is to involve qubits other than control and target qubits to take part in gate operations. We call these qubits auxiliary qubits and they are used in our gate decomposition protocols. Auxiliary qubits can be in any arbitrary states, a|0>+beta|1> , and are always restored back to their original states. Since we do not use swap gates to bring qubits adjacent to each other, compared to circuits using swap gates, the total number of gate operations used in our method is decreased, and the quantum cost is lowered. In addition, for implementing multi-control Toffoli gate operations efficiently in LNN arrays, we also show how to extend our protocols to 2D arrays. Here, in addition to translating our gate reduction techniques, directly from 1D to 2D, we use further simplification techniques for particular arrangements of qubits.

•May 1, 2014•1 citation

Natural two-qubit gate for quantum computation using the XY interaction

Norbert Schuch, Jens Siewert

The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the controlled-NOT (CNOT) gate can be realized easily. It can be shown that, e.g., with the $\mathrm{XY}$ interaction more than one two-qubit operation is required in order to realize the CNOT operation. Here we propose a two-qubit gate for the $\mathrm{XY}$ interaction which combines the CNOT and SWAP operations. By using this gate quantum circuits can be implemented efficiently, even if only nearest-neighbor coupling between the qubits is available.

arXiv:quant-ph/0209035•Physical Review A•Mar 10, 2003•246 citations

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

Realization of Surface Code Quantum Memory on Systems with Always-On Interactions

Sahar Daraeizadeh, Sarah Mostame, Preethika Kumar Eslami +2 more

We realize Surface Code quantum memories for nearest-neighbor qubits with always-on Ising interactions. This is done by utilizing multi-qubit gates that mimic the functionality of several gates. The previously proposed Surface Code memories rely on error syndrome detection circuits based on CNOT gates. In a two-dimensional planar architecture, to realize a two-qubit CNOT gate in the presence of couplings to other neighboring qubits, the interaction of the target qubit with its three other neighbors must cancel out. Here we present a new error syndrome detection circuit utilizing multi-qubit parity gates. In addition to speed up in the error correction cycles, in our approach, the depth of the error syndrome detection circuit does not grow by increasing the number of qubits in the logical qubit layout. We analytically design the system parameters to realize new five-qubit gates suitable for error syndrome detection in nearest-neighbor two-dimensional array of qubits. The five-qubit gates are designed such that the middle qubit is the target qubit and all four coupled neighbors are the control qubits. In our scheme, only one control parameter of the target qubits must be adjusted to realize controlled-unitary operations. The gate operations are confirmed with a fidelity of >99.9% in a simulated system consists of nine nearest-neighbor qubits.

arXiv:1811.09011•Nov 22, 2018•0 citations
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σX\mathbit\ensuremathσX{\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}\mathbit\ensuremathσX​\mathbit\ensuremathσX​ and \mathbit\ensuremathσY\mathbit\ensuremathσY{\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}\mathbit\ensuremathσY​\mathbit\ensuremathσ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.
We introduce a scheme for realizing universal quantum computing in a linear nearest neighbor architecture with fixed couplings. We first show how to realize a controlled-NOT gate operation between two adjacent qubits without having to isolate the two qubits from qubits adjacent to them. The gate operation is implemented by applying two consecutive pulses of equal duration, but varying amplitudes, on the target qubit. Since only a single control parameter is required in implementing our scheme, it is very efficient. We next show how our scheme can be used to realize single qubit rotations and two-qubit controlled-unitary operations. As most proposals for solid state implementations of a quantum computer use a one-dimensional line of qubits, the schemes presented here will be extremely useful.
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally applied transformations. Here we demonstrate the minimum physical requirements for such an approach: a one-dimensional array composed of two alternating ``types'' of two-state system. Each system need be sensitive only to the net state of its nearest neighbors, i.e. the number in state $``\ensuremath{\uparrow}''$ minus the number in $``\ensuremath{\downarrow}.''$ Additionally, we show that all such arrays can perform quite general parallel operations. A broad range of physical systems and interactions is suitable: we highlight two examples.
Most promising implementations in quantum computing are based on Linear Nearest Neighbor (LNN) architectures, where qubits only interact with neighbors. Multi-control Toffoli gates are used in many quantum applications such as error correction and algorithms like Shor's factorization. Typically, to implement a multi-control Toffoli gate in an LNN architecture, additional operations called swap gates are required to bring the qubits adjacent to each other. This may increase the total number of quantum gates and computational overhead of the circuit. Here, we propose a new method to implement multi-control Toffoli gates in LNN arrays without using swap gates. The circuit reduction techniques discussed here are based on 3 lemmas. Using the lemmas, we show how to implement multi-control Toffoli gates in LNN arrays with different separations between the control and target qubits. The key feature of our scheme is to involve qubits other than control and target qubits to take part in gate operations. We call these qubits auxiliary qubits and they are used in our gate decomposition protocols. Auxiliary qubits can be in any arbitrary states, a|0>+beta|1> , and are always restored back to their original states. Since we do not use swap gates to bring qubits adjacent to each other, compared to circuits using swap gates, the total number of gate operations used in our method is decreased, and the quantum cost is lowered. In addition, for implementing multi-control Toffoli gate operations efficiently in LNN arrays, we also show how to extend our protocols to 2D arrays. Here, in addition to translating our gate reduction techniques, directly from 1D to 2D, we use further simplification techniques for particular arrangements of qubits.
The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the controlled-NOT (CNOT) gate can be realized easily. It can be shown that, e.g., with the XY\mathrm{XY}XY interaction more than one two-qubit operation is required in order to realize the CNOT operation. Here we propose a two-qubit gate for the XY\mathrm{XY}XY interaction which combines the CNOT and SWAP operations. By using this gate quantum circuits can be implemented efficiently, even if only nearest-neighbor coupling between the qubits is available.
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 realize Surface Code quantum memories for nearest-neighbor qubits with always-on Ising interactions. This is done by utilizing multi-qubit gates that mimic the functionality of several gates. The previously proposed Surface Code memories rely on error syndrome detection circuits based on CNOT gates. In a two-dimensional planar architecture, to realize a two-qubit CNOT gate in the presence of couplings to other neighboring qubits, the interaction of the target qubit with its three other neighbors must cancel out. Here we present a new error syndrome detection circuit utilizing multi-qubit parity gates. In addition to speed up in the error correction cycles, in our approach, the depth of the error syndrome detection circuit does not grow by increasing the number of qubits in the logical qubit layout. We analytically design the system parameters to realize new five-qubit gates suitable for error syndrome detection in nearest-neighbor two-dimensional array of qubits. The five-qubit gates are designed such that the middle qubit is the target qubit and all four coupled neighbors are the control qubits. In our scheme, only one control parameter of the target qubits must be adjusted to realize controlled-unitary operations. The gate operations are confirmed with a fidelity of >99.9% in a simulated system consists of nine nearest-neighbor qubits.