Related papers: Which graph states are useful for quantum informat…
Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum…
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…
Graph states are a fundamental entanglement resource for multipartite quantum applications which are in general challenging to transform efficiently. While fusion operations for merging entangled states are well-developed, no direct…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modelling in science, engineering and beyond, including computer science, biology, business process modelling,…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
We introduce a new paradigm for quantum computing called Ancilla-Driven Quantum Computation (ADQC) combines aspects of the quantum circuit and the one-way model to overcome challenging issues in building large-scale quantum computers.…
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
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…
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for…
Weighted graph states extend standard graph states by associating phases with entangling edges, and may serve as resources for measurement-based quantum computation (MBQC). We analyze how the two main fusion operations, Type-I and Type-II,…
Qubit-resolved operations and measurements are required for most current quantum information processing schemes. However, these operations can be experimentally costly due to the need for local addressing, demanding significant classical…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
Recently, a novel GHZ/W graphical calculus has been established to study and reason more intuitively about interacting quantum systems. The compositional structure of this calculus was shown to be well-equipped to sufficiently express…
Measurement-based quantum computing (MBQC) in linear optical systems is promising for near-future quantum computing architecture. However, the nondeterministic nature of entangling operations and photon losses hinder the large-scale…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
We propose a universal decomposition of unitary maps over a tensorial power of C^2, introducing the key concept of "phase maps", and investigate how this decomposition can be used to implement unitary maps directly in the measurement-based…
The name graph state is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computing, and which has a natural graphical description. We present the…