2019
DOI: 10.1103/physreva.100.062301
|View full text |Cite
|
Sign up to set email alerts
|

Quantum hypergraph states in continuous variables

Abstract: The measurement based, or one-way, model of quantum computation for continuous variables uses a highly entangled state called a cluster state to accomplish the task of computing. Cluster states that are universal for computation are a subset of a class of states called graph states. These states are Gaussian states and therefore require that the homodyne detection (Gaussian measurement) scheme is supplemented with a non-Gaussian measurement for universal computation, a significant experimental challenge. Here … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 57 publications
0
2
0
Order By: Relevance
“…Graph states [5] are very important in quantum computation and quantum errorcorrecting, and are the base of measurement-based quantum computation. There are several generalizations of graph states to various types of graphs, like hypergraphs (a graph in which an edge can join any number of vertices) and we refer here to [3,7,9] and the references therein. Certainly, a natural question that arises would be how to extend the concept of graph states to quantum states associated with mixed graphs, which are graphs where some or all of the edges may be directed (and no multiple edges or loops are allowed).…”
Section: Introductionmentioning
confidence: 99%
“…Graph states [5] are very important in quantum computation and quantum errorcorrecting, and are the base of measurement-based quantum computation. There are several generalizations of graph states to various types of graphs, like hypergraphs (a graph in which an edge can join any number of vertices) and we refer here to [3,7,9] and the references therein. Certainly, a natural question that arises would be how to extend the concept of graph states to quantum states associated with mixed graphs, which are graphs where some or all of the edges may be directed (and no multiple edges or loops are allowed).…”
Section: Introductionmentioning
confidence: 99%
“…Otherwise, the verifier rejects. This scheme also works for verification of non-Gaussian CV hypergraph states [10,23]. When the target state is a hypergraph state, the verifier follows the same procedure, except that qj := U qj U † and pj := U pj U † are different from above.…”
mentioning
confidence: 99%