Related papers: Design and efficiency in graph-state computation

In this work, we develop an efficient decoding method for graph codes, a class of stabilizer quantum error-correcting codes constructed from graph states. While optimal decoding is generally NP-hard, we propose a faster decoder exploiting…

The execution of quantum algorithms on modern hardware is often constrained by noise and qubit decoherence, limiting the circuit depth and the number of gates that can be executed. Circuit optimization techniques help mitigate these…

We present a protocol for growing graph states, the resource for one-way quantum computing, when the available entanglement mechanism is highly imperfect. The distillation protocol is frugal in its use of ancilla qubits, requiring only a…

Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum…

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…

Mapping out phase diagrams of quantum systems using classical simulations can be challenging or intractable due to the computational resources required to simulate even small quantum systems far away from the thermodynamic limit. We…

We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…

Greenberger-Horne-Zeilinger (GHZ) states play a central role in quantum computing and communication protocols, as a typical multipartite entanglement resource. This work introduces an efficient enumeration and simulation method for circuits…

Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…

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…

Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…

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…

A bottleneck for analyzing the interplay between magic and entanglement is the computation of these quantities in highly entangled quantum many-body magic states. Efficient extraction of entanglement can also inform our understanding of…

Diagrammatic techniques for reasoning about monoidal categories provide an intuitive understanding of the symmetries and connections of interacting computational processes. In the context of categorical quantum mechanics, Coecke and…

We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus. The dynamics of the entangling bus is described by an effective…

Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…

We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…

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…

Graph states and hypergraph states are of wide interest in quantum information processing and foundational studies. Efficient verification of these states is a key to various applications. Here we propose a simple method for verifying…

The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…