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/0104117 · Physical Review Letters

Quantum Computing Without Local Control of Qubit-Qubit Interactions

Simon C. Benjamin

Published Dec 19, 2001• 86 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.88.017904

Related papers

Quantum Computation with Untunable Couplings

Xingxiang Zhou, Zheng-Wei Zhou, Guang‐Can Guo +1 more

Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme to remove the necessity of switching the couplings between qubits for two bit gates, which are more costly in many cases. Our strategy is to compute with encoded qubits in and out of carefully designed interaction free subspaces analogous to decoherence free subspaces. We give two examples to show how universal quantum computation is realized in our scheme with local manipulations to physical qubits only, for both diagonal and off diagonal interactions.

arXiv:quant-ph/0209142•Physical Review Letters•Oct 21, 2002•75 citations

Quantum Computing with an Always-On Heisenberg Interaction

Simon C. Benjamin, Sougato Bose

Many promising schemes for quantum computing (QC) involve switching "on" and "off" a physical coupling between qubits. This may prove extremely difficult to achieve experimentally. Here we show that systems with a constant Heisenberg coupling can be employed for QC if we actively "tune" the transition energies of individual qubits. Moreover, we can collectively tune the qubits to obtain an exceptionally simple scheme: computations are controlled via a single "switch" of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.

arXiv:quant-ph/0210157•Physical Review Letters•Jun 19, 2003•188 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

Local operations in qubit arrays via global periodic manipulation

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

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.

arXiv:quant-ph/0610168•Physical Review A•Nov 27, 2006•11 citations

Quantum computing without qubit-qubit interactions

Almut Beige

Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed. However, finding a really scalable and robust quantum computing architecture remains a challenge for both, experimentalists and theoreticians. In most setups decoherence becomes non-negligible when one tries to perform entangling gate operations using the coherent control of qubit-qubit interactions. However, in this proceedings we show that two-qubit gate operations can be implemented even without qubit-qubit interactions and review a recent quantum computing scheme by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)] using only single photon sources (e.g. atom-cavity systems, NV colour centres or quantum dots) and photon pair measurements.

arXiv:cond-mat/0512121•Dec 6, 2005•1 citation

Scalable Generation of Cluster State with Superconducting Circuit

佐藤, 貴彦

Recently, fault tolerant quantum computation such as surface coding and topological quantum computation has been paid attention to due to high threshold against computational errors compared with that of conventional gate-model quantum computation.These schemes use a two or three-dimensional cluster state as universal resources for quantum computation.We can generate a cluster state by performing controlled-phase gates on an initial state prepared in |+⟩ state, where the control-phase gates are realized by nearest neighbor Ising type interactions.There are many proposal to realize Ising type interaction such as ultracold atoms in an optical lattice, superconducting charge qubits, superconducting spin qubits, resonator wave guides, nitrogen-vacancy centers, and quantum dots.Among many candidates, we especially discuss superconducting flux qubits.Superconducting flux qubits have a strong anharmonicity, so that we can perform high-speed single-qubit rotation with excellent fidelity.Usually, implementation of high-fidelity two-qubit gates is the hardest part for the realization of quantum computation.Two qubit gates require in-situ turn on/off the interaction between qubits by the external control apparatus.Since imperfection of the interaction control tends to induce spatially correlated errors between qubits, sophisticated technology is required to suppress such error rate below the threshold of fault tolerant quantum computation.Up to now, the generation of a large cluster state using solid-state qubit has not been demonstrated in a scalable manner yet.One of the main obstacles is the requirement for independent control of two-qubit gates that are necessary for the scalable quantum information processing.For a superconducting flux qubit, existing method uses applied magnetic field to control the interaction.It is known that the application of magnetic field to local area is difficult.Thus, it is hard to implement local control of the interaction without cross-talk problem where unwanted errors occurs between qubits.Firstly, we propose a novel way to control a number of two-qubit gates independently without using the on/off switching of locally applied magnetic field.Specifically, we assume the superconducting flux qubits that are inductively coupled with each other via always-on Ising interaction.Unlike the previous method to change the interaction strength with unitary operations, we fully make use of non-unitary properties of projective measurements so that we can effectively turn on/off the interaction via quantum feedforward.Also, we show how to generate a two or three-dimensional cluster state that are universal resource for fault tolerant quantum computation with constant stepsize operations.The on/off switching of locally applied magnetic field is not necessary to First of all, I would like to thank my adviser Professor Hiroshi Imai for his valuable comments and continuous support during the last five years.

•Jul 21, 2016•0 citations
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.
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme to remove the necessity of switching the couplings between qubits for two bit gates, which are more costly in many cases. Our strategy is to compute with encoded qubits in and out of carefully designed interaction free subspaces analogous to decoherence free subspaces. We give two examples to show how universal quantum computation is realized in our scheme with local manipulations to physical qubits only, for both diagonal and off diagonal interactions.
Many promising schemes for quantum computing (QC) involve switching "on" and "off" a physical coupling between qubits. This may prove extremely difficult to achieve experimentally. Here we show that systems with a constant Heisenberg coupling can be employed for QC if we actively "tune" the transition energies of individual qubits. Moreover, we can collectively tune the qubits to obtain an exceptionally simple scheme: computations are controlled via a single "switch" of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.
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.
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed. However, finding a really scalable and robust quantum computing architecture remains a challenge for both, experimentalists and theoreticians. In most setups decoherence becomes non-negligible when one tries to perform entangling gate operations using the coherent control of qubit-qubit interactions. However, in this proceedings we show that two-qubit gate operations can be implemented even without qubit-qubit interactions and review a recent quantum computing scheme by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)] using only single photon sources (e.g. atom-cavity systems, NV colour centres or quantum dots) and photon pair measurements.
Recently, fault tolerant quantum computation such as surface coding and topological quantum computation has been paid attention to due to high threshold against computational errors compared with that of conventional gate-model quantum computation.These schemes use a two or three-dimensional cluster state as universal resources for quantum computation.We can generate a cluster state by performing controlled-phase gates on an initial state prepared in |+⟩ state, where the control-phase gates are realized by nearest neighbor Ising type interactions.There are many proposal to realize Ising type interaction such as ultracold atoms in an optical lattice, superconducting charge qubits, superconducting spin qubits, resonator wave guides, nitrogen-vacancy centers, and quantum dots.Among many candidates, we especially discuss superconducting flux qubits.Superconducting flux qubits have a strong anharmonicity, so that we can perform high-speed single-qubit rotation with excellent fidelity.Usually, implementation of high-fidelity two-qubit gates is the hardest part for the realization of quantum computation.Two qubit gates require in-situ turn on/off the interaction between qubits by the external control apparatus.Since imperfection of the interaction control tends to induce spatially correlated errors between qubits, sophisticated technology is required to suppress such error rate below the threshold of fault tolerant quantum computation.Up to now, the generation of a large cluster state using solid-state qubit has not been demonstrated in a scalable manner yet.One of the main obstacles is the requirement for independent control of two-qubit gates that are necessary for the scalable quantum information processing.For a superconducting flux qubit, existing method uses applied magnetic field to control the interaction.It is known that the application of magnetic field to local area is difficult.Thus, it is hard to implement local control of the interaction without cross-talk problem where unwanted errors occurs between qubits.Firstly, we propose a novel way to control a number of two-qubit gates independently without using the on/off switching of locally applied magnetic field.Specifically, we assume the superconducting flux qubits that are inductively coupled with each other via always-on Ising interaction.Unlike the previous method to change the interaction strength with unitary operations, we fully make use of non-unitary properties of projective measurements so that we can effectively turn on/off the interaction via quantum feedforward.Also, we show how to generate a two or three-dimensional cluster state that are universal resource for fault tolerant quantum computation with constant stepsize operations.The on/off switching of locally applied magnetic field is not necessary to First of all, I would like to thank my adviser Professor Hiroshi Imai for his valuable comments and continuous support during the last five years.