Related papers: Optimal preparation of graph states
The Clifford group is the set of gates generated by the controlled not gates, the Hadamard gate and the P={{1,0},{0,i}} gate. We will say that a n-qubit state is a Clifford state if it can be prepared using Clifford gates. In this paper we…
Graph states are a key resource for measurement-based quantum computation and quantum networking, but state-preparation costs limit their practical use. Graph states related by local complement (LC) operations are equivalent up to…
We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…
Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Designing state preparation circuits that entangle qubits efficiently with fewer two-qubit gates enhances accuracy and alleviates…
The preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms, and the effort to reduce its circuit complexity is a significant challenge. In the literature, the quantum state preparation algorithm by…
Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
Measurement based quantum computing is preformed by adding non-Clifford measurements to a prepared stabilizer states. Entangling gates like CZ are likely to have lower fidelities due to the nature of interacting qubits, so when preparing a…
The ability to fault-tolerantly prepare CAT states, also known as multi-qubit GHZ states, is an important primitive for quantum error correction. It is required for Shor-style syndrome extraction, and can also be used as a subroutine for…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and…
Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into…
We propose schemes to extract arbitrary graph states from two-dimensional cluster states by locally manipulating the qubits solely via single-qubit measurements. We introduce graph state manipulation tools that allow one to increase the…
We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven or eight qubits, we show that success probabilities of 1/4, 1/2 and 1 respectively can be achieved.…
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static…
The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 (2004)] fails to distinguish between inequivalent classes under local Clifford operations if n > 6. On the other hand,…
Graph states are a fundamental class of multipartite entangled quantum states with wide-ranging applications in quantum information and computation. In this work, we develop a systematic framework for constructing and analyzing…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…