Related papers: Complexity of Graph State Preparation
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
Graph states have been used for quantum error correction by Schlingemann et al. [Physical Review A 65.1 (2001): 012308]. Hypergraph states [Physical Review A 87.2 (2013): 022311] are generalizations of graph states and they have been used…
Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very…
Entanglement is a crucial resource for quantum information processing, and so protocols to generate high fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate…
Photonic graph states are essential resources for quantum computation and communication. Deterministic emitter-based generation of graph states overcomes the scalability issues of probabilistic approaches; nonetheless, their experimental…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
We present a simple protocol for certifying graph states in quantum networks using stabiliser measurements. The certification statements can easily be applied to different protocols using graph states. We see for example how it can be used…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a…
Quantum state preparation is a fundamental primitive in quantum algorithms for encoding classical data into quantum amplitudes. We compare the cost of preparing general $n$-qubit states with real amplitudes using two common paradigms:…
Quantum state preparation is a fundamental task in quantum computing and quantum information processing. With the rapid advancement of quantum technologies, efficient quantum state preparation has become increasingly important. This paper…
We investigate the fundamental time complexity, as constrained by Lieb-Robinson bounds, for preparing entangled states useful in quantum metrology. We relate the minimum time to the Quantum Fisher Information ($F_Q$) for a system of $N$…
We develop a representation of an n-qubit register that parameterizes its statevector as a series of nested entanglements. We show that the recursive substructure of this representation provides a natural framework for automating the…
In this paper, we propose a new way to represent graphs in quantum space. In that approach, we replace the rows of the adjacency matrix of the graph by state vectors in the occupation number representation. Unlike the traditional definition…
Quantum computation is a promising emerging technology which, compared to conventional computation, allows for substantial speed-ups e.g. for integer factorization or database search. However, since physical realizations of quantum…
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks. This paper is…
Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. We seek to…
We consider the problem of learning $N$ identical copies of an unknown $n$-qubit quantum graph state with product measurements. These graph states have corresponding graphs where every vertex has exactly $d$ neighboring vertices. Here, we…
We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using…