Related papers: Quantum Graph-State Synthesis with SAT
Stabilizer states form a ubiquitous family of quantum states that can be graphically represented through the graph state formalism. A fundamental property of graph states is that applying a local complementation - a well-known and…
As quantum computing technology slowly matures and the number of available qubits on a QPU gradually increases, interest in assessing the capabilities of quantum computing hardware in a scalable manner is growing. One of the key properties…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
Graph states are computationally powerful quantum states with many applications including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analogue…
We propose a simple setup for the conversion of multipartite entangled states in a quantum network with restricted access. The scheme uses nonlocal operations to enable the preparation of states that are inequivalent under local operations…
Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, "consume" entangled quantum states during their execution. When participants are located at distant sites, these…
The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…
Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of…
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages, such as Cirq and Q#. The computation can then be implemented using a series of non-Pauli…
The direct compilation of algorithm-specific graph states in measurement-based quantum computation (MBQC) can lead to resource reductions in terms of circuit depth, entangling gates, and even the number of physical qubits. In this work, we…
Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure…
Non-symmetric GHZ states ($n$-GHZ$_\alpha$), defined by unequal superpositions of $|00...0>$ and $|11...1>$, naturally emerge in experiments due to decoherence, control errors, and state preparation imperfections. Despite their relevance in…
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…
Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford group. For each of these classes we obtain a representative which requires the minimum number of controlled-Z gates for…
Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…
Image-based data is a popular arena for testing quantum machine learning algorithms. A crucial factor in realizing quantum advantage for these applications is the ability to efficiently represent images as quantum states. Here we present a…