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:quant-ph/0610168 · Physical Review A

Local operations in qubit arrays via global periodic manipulation

Zheng-Wei Zhou, Yong‐Jian Han, Guang‐Can Guo

Published Nov 27, 2006• 11 citations
arXivHTMLPDF

Abstract

We provide a scheme for quantum computation in lattice systems via global but periodic manipulation, in which only effective periodic magnetic fields and global nearest-neighbor interactions are required. All operations in our scheme are attainable in optical-lattice or solid-state systems. We also investigate universal quantum operations and quantum simulation of two-dimensional lattices. We find that global manipulations are superior in simulating some nontrivial many-body Hamiltonians.

DOI
10.1103/physreva.74.052334

Related papers

Quantum computation in optical lattices via global laser addressing

Alastair Kay, Jiannis K. Pachos

A scheme for globally addressing a quantum computer is presented along with its realization in an optical lattice set-up of one, two or three dimensions. The required resources are mainly those necessary for performing quantum simulations of spin systems with optical lattices, circumventing the necessity for single qubit addressing. We present the control procedures, in terms of laser manipulations, required to realize universal quantum computation. Error avoidance with the help of the quantum Zeno effect is presented and a scheme for globally addressed error correction is given. The latter does not require measurements during the computation, facilitating its experimental implementation. As an illustrative example, the pulse sequence for the factorization of the number 15 is given.

arXiv:quant-ph/0406073•New Journal of Physics•Oct 1, 2004•36 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

Quantum Computing Without Local Control of Qubit-Qubit Interactions

Simon C. Benjamin

If the interaction between qubits is not diagonal in the computational basis (e.g., the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, schemes for quantum computing typically demand local control of the interaction strength between each pair of neighboring qubits. Here we demonstrate that this degree of control is not necessary: it suffices to switch the interaction collectively, something that can in principle be achieved by global fields rather than with local manipulations. This observation may offer a significant simplification for various implementations, including solid state and optical lattice schemes.

arXiv:quant-ph/0104117•Physical Review Letters•Dec 19, 2001•86 citations

Simulation of quantum dynamics with quantum optical systems

E. Jané, Guifré Vidal, Wolfgang Dür +2 more

We propose the use of quantum optical systems to perform universal simulation of quantum dynamics. Two specific implementations that require present technology are put forward for illustrative purposes. The first scheme consists of neutral atoms stored in optical lattices, while the second scheme consists of ions stored in an array of micro--traps. Each atom (ion) supports a two--level system, on which local unitary operations can be performed through a laser beam. A raw interaction between neighboring two--level systems is achieved by conditionally displacing the corresponding atoms (ions) Then, average Hamiltonian techniques are used to achieve evolutions in time according to a large class of Hamiltonians.

arXiv:quant-ph/0207011•Quantum Information and Computation•Jan 1, 2003•152 citations

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

Spin- 1∕2 particles moving on a two-dimensional lattice with nearest-neighbor interactions can realize an autonomous quantum computer

Dominik Janzing

What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a ten-local finite-range interaction among qubits on a two-dimensional (2D) lattice having this property. Here we show that pair-interactions among qutrits on a 2D lattice are sufficient, too, and can also implement an ergodic computer where the result can be read out from the time average state after some postselection with high success probability. Two of the three qutrit states are given by the two levels of a spin-$1∕2$ particle located at a specific lattice site, the third state is its absence. Usual hopping terms together with an attractive force among adjacent particles induce a coupled quantum walk where the particle spins are subjected to spatially inhomogeneous interactions implementing holonomic quantum computing. The holonomic method ensures that the implemented circuit does not depend on the time needed for the walk. Even though the implementation of the required type of spin-spin interactions is currently unclear, the model shows that quite simple Hamiltonians are powerful enough to allow for universal quantum computing in a closed physical system.

arXiv:quant-ph/0506270•Physical Review A•Jan 9, 2007•28 citations
We provide a scheme for quantum computation in lattice systems via global but periodic manipulation, in which only effective periodic magnetic fields and global nearest-neighbor interactions are required. All operations in our scheme are attainable in optical-lattice or solid-state systems. We also investigate universal quantum operations and quantum simulation of two-dimensional lattices. We find that global manipulations are superior in simulating some nontrivial many-body Hamiltonians.
A scheme for globally addressing a quantum computer is presented along with its realization in an optical lattice set-up of one, two or three dimensions. The required resources are mainly those necessary for performing quantum simulations of spin systems with optical lattices, circumventing the necessity for single qubit addressing. We present the control procedures, in terms of laser manipulations, required to realize universal quantum computation. Error avoidance with the help of the quantum Zeno effect is presented and a scheme for globally addressed error correction is given. The latter does not require measurements during the computation, facilitating its experimental implementation. As an illustrative example, the pulse sequence for the factorization of the number 15 is given.
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.
If the interaction between qubits is not diagonal in the computational basis (e.g., the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, schemes for quantum computing typically demand local control of the interaction strength between each pair of neighboring qubits. Here we demonstrate that this degree of control is not necessary: it suffices to switch the interaction collectively, something that can in principle be achieved by global fields rather than with local manipulations. This observation may offer a significant simplification for various implementations, including solid state and optical lattice schemes.
We propose the use of quantum optical systems to perform universal simulation of quantum dynamics. Two specific implementations that require present technology are put forward for illustrative purposes. The first scheme consists of neutral atoms stored in optical lattices, while the second scheme consists of ions stored in an array of micro--traps. Each atom (ion) supports a two--level system, on which local unitary operations can be performed through a laser beam. A raw interaction between neighboring two--level systems is achieved by conditionally displacing the corresponding atoms (ions) Then, average Hamiltonian techniques are used to achieve evolutions in time according to a large class of Hamiltonians.
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.
What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a ten-local finite-range interaction among qubits on a two-dimensional (2D) lattice having this property. Here we show that pair-interactions among qutrits on a 2D lattice are sufficient, too, and can also implement an ergodic computer where the result can be read out from the time average state after some postselection with high success probability. Two of the three qutrit states are given by the two levels of a spin-1∕21∕21∕2 particle located at a specific lattice site, the third state is its absence. Usual hopping terms together with an attractive force among adjacent particles induce a coupled quantum walk where the particle spins are subjected to spatially inhomogeneous interactions implementing holonomic quantum computing. The holonomic method ensures that the implemented circuit does not depend on the time needed for the walk. Even though the implementation of the required type of spin-spin interactions is currently unclear, the model shows that quite simple Hamiltonians are powerful enough to allow for universal quantum computing in a closed physical system.