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:1112.5133 · Physical Review A

Maximally entangled gapped ground state of lattice fermions

David L. Feder

Published Jan 12, 2012• 4 citations
arXivHTMLPDF

Abstract

Entanglement between the constituents of a quantum system is an essential resource in the implementation of many quantum processes and algorithms. Indeed, universal quantum computation is possible by measuring individual qubits that constitute highly entangled ``cluster states.'' In this work, it is shown that the unique gapped ground state of noninteracting fermions hopping on a specially prepared lattice is equivalent to a cluster state, where the entanglement between qubits results from fermionic indistinguishability and antisymmetry. A deterministic strategy for universal measurement-based quantum computation with this resource is described. Because most matter is composed of fermions, these results suggest that resources for quantum information processing might be generic in nature.

DOI
10.1103/physreva.85.012312

Related papers

Simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation

Stephen D. Bartlett, Terry Rudolph

We present a simple quantum many-body system---a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions---such that the ground state is a universal resource for quantum computation using single-qubit measurements. This ground state approximates a cluster state that is encoded into a larger number of physical qubits. The Hamiltonian we use is motivated by the projected entangled pair states, which provide a transparent mechanism to produce such approximate encoded cluster states on square or other lattice structures (as well as a variety of other quantum states) as the ground state. We show that the error in this approximation takes the form of independent errors on bonds occurring with a fixed probability. The energy gap of such a system, which in part determines its usefulness for quantum computation, is shown to be independent of the size of the lattice. In addition, we show that the scaling of this energy gap in terms of the coupling constants of the Hamiltonian is directly determined by the lattice geometry. As a result, the approximate encoded cluster state obtained on a hexagonal lattice (a resource that is also universal for quantum computation) can be shown to have a larger energy gap than one on a square lattice with an equivalent Hamiltonian.

arXiv:quant-ph/0609002•Physical Review A•Oct 24, 2006•72 citations

Quantum computing via measurements only

Robert Raussendorf, Hans J. Briegel

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.

arXiv:quant-ph/0010033•Oct 7, 2000•57 citations

Gapped Two-Body Hamiltonian Whose Unique Ground State Is Universal for One-Way Quantum Computation

Xie Chen, Bei Zeng, Zheng‐Cheng Gu +2 more

Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be remarkably valuable, if only it were thermodynamically stable and experimentally accessible, by virtue of being the unique ground state of a physically reasonable Hamiltonian made of two-body, nearest-neighbor interactions. We introduce such a state, composed of six-state particles on a hexagonal lattice, and describe a general method for analyzing its properties based on its projected entangled pair state representation.

arXiv:0812.4067•Physical Review Letters•Jun 5, 2009•77 citations

Fermionic measurement-based quantum computation

Yu-Ju Chiu, Xie Chen, Isaac L. Chuang

Fermions, as a major class of quantum particles, provide platforms for quantum information processing beyond the possibilities of spins or bosons, which have been studied more extensively. One particularly interesting model to study, in view of recent progress in manipulating ultracold fermion gases, is the fermionic version of measurement-based quantum computation (MBQC), which implements full quantum computation with only single-site measurements on a proper fermionic many-body resource state. However, it is not known which fermionic states can be used as the resource states for MBQC and how to find them. In this paper, we generalize the framework of spin MBQC to fermions. In particular, we provide a general formalism to construct many-body entangled fermion resource states for MBQC based on the fermionic projected entangled pair state representation. We give a specific fermionic state which enables universal MBQC and demonstrate that the nonlocality inherent in fermion systems can be properly taken care of with suitable measurement schemes. Such a framework opens up possibilities of finding MBQC resource states which can be more readily realized in the laboratory.

arXiv:1207.5846•Physical Review A•Jan 8, 2013•21 citations

Cluster-state preparation and multipartite entanglement analyzer with fermions

Xinglai Zhang, Mang Feng, K. Gao

Quantum cluster states and entangled-state analyzers are essential to measurement-based quantum computing. We propose to generate a quantum cluster state and to make a multipartite entanglement analyzer by using noninteracting free electrons or conduction electrons in quantum dots, based on polarizing beam splitters, charge detectors, and single-spin rotations. Our schemes are deterministic without the need of qubit-qubit interaction.

arXiv:quant-ph/0512067•Physical Review A•Jan 11, 2006•45 citations

Fundamentals of universality in one-way quantum computation

M Van den Nest, Wolfgang Dür, A Miyake +1 more

In this paper, we build a framework allowing for a systematic investigation of the fundamental issue: ' Which quantum states serve as universal resources for measurement-based (one-way) quantum computation? ' We start our study by re-examining what is exactly meant by 'universality' in quantum computation, and what the implications are for universal one-way quantum computation. Given the framework of a measurement-based quantum computer, where quantum information is processed by local operations only, we find that the most general universal one-way quantum computer is one which is capable of accepting arbitrary classical inputs and producing arbitrary quantum outputs—we refer to this property as CQ-universality. We then show that a systematic study of CQ-universality in one-way quantum computation is possible by identifying entanglement features that are required to be present in every universal resource. In particular, we find that a large class of entanglement measures must reach its supremum on every universal resource. These insights are used to identify several families of states as being not universal, such as one-dimensional (1D) cluster states, Greenberger–Horne–Zeilinger (GHZ) states, W states, and ground states of non-critical 1D spin systems. Our criteria are strengthened by considering the efficiency of a quantum computation, and we find that entanglement measures must obey a certain scaling law with the system size for all efficient universal resources. This again leads to examples of non-universal resources, such as, e.g. ground states of critical 1D spin systems. On the other hand, we provide several examples of efficient universal resources, namely graph states corresponding to hexagonal, triangular and Kagome lattices. Finally, we consider the more general notion of encoded CQ-universality, where quantum outputs are allowed to be produced in an encoded form. Again we provide entanglement-based criteria for encoded universality. Moreover, we present a general procedure to construct encoded universal resources.

arXiv:quant-ph/0702116•New Journal of Physics•Jun 29, 2007•97 citations
Entanglement between the constituents of a quantum system is an essential resource in the implementation of many quantum processes and algorithms. Indeed, universal quantum computation is possible by measuring individual qubits that constitute highly entangled ``cluster states.'' In this work, it is shown that the unique gapped ground state of noninteracting fermions hopping on a specially prepared lattice is equivalent to a cluster state, where the entanglement between qubits results from fermionic indistinguishability and antisymmetry. A deterministic strategy for universal measurement-based quantum computation with this resource is described. Because most matter is composed of fermions, these results suggest that resources for quantum information processing might be generic in nature.
We present a simple quantum many-body system---a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions---such that the ground state is a universal resource for quantum computation using single-qubit measurements. This ground state approximates a cluster state that is encoded into a larger number of physical qubits. The Hamiltonian we use is motivated by the projected entangled pair states, which provide a transparent mechanism to produce such approximate encoded cluster states on square or other lattice structures (as well as a variety of other quantum states) as the ground state. We show that the error in this approximation takes the form of independent errors on bonds occurring with a fixed probability. The energy gap of such a system, which in part determines its usefulness for quantum computation, is shown to be independent of the size of the lattice. In addition, we show that the scaling of this energy gap in terms of the coupling constants of the Hamiltonian is directly determined by the lattice geometry. As a result, the approximate encoded cluster state obtained on a hexagonal lattice (a resource that is also universal for quantum computation) can be shown to have a larger energy gap than one on a square lattice with an equivalent Hamiltonian.
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.
Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be remarkably valuable, if only it were thermodynamically stable and experimentally accessible, by virtue of being the unique ground state of a physically reasonable Hamiltonian made of two-body, nearest-neighbor interactions. We introduce such a state, composed of six-state particles on a hexagonal lattice, and describe a general method for analyzing its properties based on its projected entangled pair state representation.
Fermions, as a major class of quantum particles, provide platforms for quantum information processing beyond the possibilities of spins or bosons, which have been studied more extensively. One particularly interesting model to study, in view of recent progress in manipulating ultracold fermion gases, is the fermionic version of measurement-based quantum computation (MBQC), which implements full quantum computation with only single-site measurements on a proper fermionic many-body resource state. However, it is not known which fermionic states can be used as the resource states for MBQC and how to find them. In this paper, we generalize the framework of spin MBQC to fermions. In particular, we provide a general formalism to construct many-body entangled fermion resource states for MBQC based on the fermionic projected entangled pair state representation. We give a specific fermionic state which enables universal MBQC and demonstrate that the nonlocality inherent in fermion systems can be properly taken care of with suitable measurement schemes. Such a framework opens up possibilities of finding MBQC resource states which can be more readily realized in the laboratory.
In this paper, we build a framework allowing for a systematic investigation of the fundamental issue: ' Which quantum states serve as universal resources for measurement-based (one-way) quantum computation? ' We start our study by re-examining what is exactly meant by 'universality' in quantum computation, and what the implications are for universal one-way quantum computation. Given the framework of a measurement-based quantum computer, where quantum information is processed by local operations only, we find that the most general universal one-way quantum computer is one which is capable of accepting arbitrary classical inputs and producing arbitrary quantum outputs—we refer to this property as CQ-universality. We then show that a systematic study of CQ-universality in one-way quantum computation is possible by identifying entanglement features that are required to be present in every universal resource. In particular, we find that a large class of entanglement measures must reach its supremum on every universal resource. These insights are used to identify several families of states as being not universal, such as one-dimensional (1D) cluster states, Greenberger–Horne–Zeilinger (GHZ) states, W states, and ground states of non-critical 1D spin systems. Our criteria are strengthened by considering the efficiency of a quantum computation, and we find that entanglement measures must obey a certain scaling law with the system size for all efficient universal resources. This again leads to examples of non-universal resources, such as, e.g. ground states of critical 1D spin systems. On the other hand, we provide several examples of efficient universal resources, namely graph states corresponding to hexagonal, triangular and Kagome lattices. Finally, we consider the more general notion of encoded CQ-universality, where quantum outputs are allowed to be produced in an encoded form. Again we provide entanglement-based criteria for encoded universality. Moreover, we present a general procedure to construct encoded universal resources.