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

Cluster state generation in one-dimensional Kitaev model via shortcut to adiabaticity

Thi Ha Kyaw, L. C. Kwek

Published Dec 19, 2017• 0 citations
OpenAlex

Abstract

We propose a scheme to obtain computationally useful resource states called cluster states used in measurement-based quantum computation via transitionless quantum driving algorithm. We show that the original and the auxiliary Hamiltonians needed to realize our proposal are composed of only two-body interactions, which are well within the reach of the current state-of-the-art quantum technologies.

Related papers

Cluster state generation in one-dimensional Kitaev honeycomb model via shortcut to adiabaticity

Thi Ha Kyaw, L. C. Kwek

We propose a mean to obtain computationally useful resource states also known as cluster states, for measurement-based quantum computation, via transitionless quantum driving algorithm. The idea is to cool the system to its unique ground state and tune some control parameters to arrive at computationally useful resource state, which is in one of the degenerate ground states. Even though there is set of conserved quantities already present in the model Hamiltonian, which prevents the instantaneous state to go to any other eigenstate subspaces, one cannot quench the control parameters to get the desired state. In that case, the state will not evolve. With involvement of the shortcut Hamiltonian, we obtain cluster states in fast-forward manner. We elaborate our proposal in the one-dimensional Kitaev honeycomb model, and show that the auxiliary Hamiltonian needed for the counterdiabatic driving is of M -body interaction.

arXiv:1712.06773•New Journal of Physics•Mar 1, 2018•12 citations

Measurement-Based Quantum Computation on Two-Body Interacting Qubits with Adiabatic Evolution

Thi Ha Kyaw, Ying Li, L. C. Kwek

A cluster state cannot be a unique ground state of a two-body interacting Hamiltonian. Here, we propose the creation of a cluster state of logical qubits encoded in spin-1/2 particles by adiabatically weakening two-body interactions. The proposal is valid for any spatial dimensional cluster states. Errors induced by thermal fluctuations and adiabatic evolution within finite time can be eliminated ensuring fault-tolerant quantum computing schemes.

arXiv:1307.5140•Physical Review Letters•Oct 28, 2014•9 citations

Layer-by-layer generation of cluster states

Katherine L. Brown, Dominic C. Horsman, Viv M. Kendon +1 more

Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular, we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we cannot destroy these links, we show how to create an $n\ifmmode\times\else\texttimes\fi{}m$ cluster using just $3nm\ensuremath{-}2n\ensuremath{-}\ensuremath{\lceil}3m/2\ensuremath{\rceil}+3$ operations. This gives more than a factor of 2 savings over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need $\ensuremath{\lceil}\frac{1}{3}(8nm\ensuremath{-}4n\ensuremath{-}4m\ensuremath{-}8)\ensuremath{\rceil}$ operations. Unfortunately, the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A halfway scheme, that keeps a modular generation but saves additional operations over never destroying links requires only $3nm\ensuremath{-}2n\ensuremath{-}2m+4$ operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.

arXiv:1111.1774•Physical Review A•May 7, 2012•14 citations

Generating shortcuts to adiabaticity in quantum and classical dynamics

Christopher Jarzynski

Transitionless quantum driving achieves adiabatic evolution in a hurry, using a counterdiabatic Hamiltonian to stifle nonadiabatic transitions. Here this shortcut to adiabaticity is cast in terms of a generator of adiabatic transport. This yields a classical analog of transitionless driving, and provides a strategy for constructing quantal counterdiabatic Hamiltonians. As an application of this framework, exact classical and quantal counterdiabatic terms are obtained for a particle in a box and for even-power-law potentials in one degree of freedom.

arXiv:1305.4967•Physical Review A•Oct 4, 2013•159 citations

Transitionless-based shortcuts for rapidly generating two-atom 3D entanglement

Rui Peng, Yue Zheng, Liu, Si-Wen +3 more

An experimentally feasible scheme is proposed for rapidly generating two-atom three-dimensional (3D) entanglement with one step. As one technique of shortcuts to adiabaticity, transitionless quantum driving is applied to speed up the adiabatic generation of two-atom 3D entanglement. Apart from the rapid rate, the scheme has much higher experimental feasibility than the recent research (Quant. Inf. Process. DOI: 10.1007/s11128-016-1453-2, 2016). Besides, numerical simulations indicate the scheme has strong robustness against parameter deviations and decoherence.

arXiv:1612.08779•Dec 28, 2016•0 citations

Quantum State Reduction for Universal Measurement Based Computation

Xie Chen, Runyao Duan, Zhengfeng Ji +1 more

Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the past decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states.

arXiv:1002.1567•Physical Review Letters•Jul 7, 2010•29 citations
We propose a scheme to obtain computationally useful resource states called cluster states used in measurement-based quantum computation via transitionless quantum driving algorithm. We show that the original and the auxiliary Hamiltonians needed to realize our proposal are composed of only two-body interactions, which are well within the reach of the current state-of-the-art quantum technologies.
We propose a mean to obtain computationally useful resource states also known as cluster states, for measurement-based quantum computation, via transitionless quantum driving algorithm. The idea is to cool the system to its unique ground state and tune some control parameters to arrive at computationally useful resource state, which is in one of the degenerate ground states. Even though there is set of conserved quantities already present in the model Hamiltonian, which prevents the instantaneous state to go to any other eigenstate subspaces, one cannot quench the control parameters to get the desired state. In that case, the state will not evolve. With involvement of the shortcut Hamiltonian, we obtain cluster states in fast-forward manner. We elaborate our proposal in the one-dimensional Kitaev honeycomb model, and show that the auxiliary Hamiltonian needed for the counterdiabatic driving is of M -body interaction.
Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular, we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we cannot destroy these links, we show how to create an $n\ifmmode\times\else\texttimes\fi{}m$ cluster using just $3nm\ensuremath{-}2n\ensuremath{-}\ensuremath{\lceil}3m/2\ensuremath{\rceil}+3$ operations. This gives more than a factor of 2 savings over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need $\ensuremath{\lceil}\frac{1}{3}(8nm\ensuremath{-}4n\ensuremath{-}4m\ensuremath{-}8)\ensuremath{\rceil}$ operations. Unfortunately, the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A halfway scheme, that keeps a modular generation but saves additional operations over never destroying links requires only $3nm\ensuremath{-}2n\ensuremath{-}2m+4$ operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.
Transitionless quantum driving achieves adiabatic evolution in a hurry, using a counterdiabatic Hamiltonian to stifle nonadiabatic transitions. Here this shortcut to adiabaticity is cast in terms of a generator of adiabatic transport. This yields a classical analog of transitionless driving, and provides a strategy for constructing quantal counterdiabatic Hamiltonians. As an application of this framework, exact classical and quantal counterdiabatic terms are obtained for a particle in a box and for even-power-law potentials in one degree of freedom.
An experimentally feasible scheme is proposed for rapidly generating two-atom three-dimensional (3D) entanglement with one step. As one technique of shortcuts to adiabaticity, transitionless quantum driving is applied to speed up the adiabatic generation of two-atom 3D entanglement. Apart from the rapid rate, the scheme has much higher experimental feasibility than the recent research (Quant. Inf. Process. DOI: 10.1007/s11128-016-1453-2, 2016). Besides, numerical simulations indicate the scheme has strong robustness against parameter deviations and decoherence.
Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the past decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states.