Related papers: Measurement-based quantum computation on weighted …
We introduce novel schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in [Phys. Rev. Lett. 98, 220503 (2007), quant-ph/0609149]. Our method makes use of…
Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal…
We provide a graphical method to describe and analyze non-Gaussian quantum states using a hypergraph framework. These states are pivotal resources for quantum computing, communication, and metrology, but their characterization is hindered…
Quantum graph state is a special class of nonlocal state among multiple quantum particles, underpinning several nonclassical and promising applications such as quantum computing and quantum secret sharing. Recently, establishing quantum…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model…
We present strictly efficient schemes for scalable measurement-based quantum computing using continuous-variable systems: These schemes are based on suitable non-Gaussian resource states, ones that can be prepared using interactions of…
We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. The case when all the qubits are initially prepared in arbitrary states is investigated. We obtain the…
We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique further develops tools from many-body physics - based on finitely correlated or projected entangled pair states -…
Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study. In this paper, we propose a…
In this work we introduce a general scheme for measurement based quantum computation in continuous variables. Our approach does not necessarily rely on the use of ancillary cluster states to achieve its aim, but rather on the detection of a…
The quantum circuit model is the default for encoding an algorithm intended for a NISQ computer or a quantum computing simulator. A simple graph and through it, a graph state - quantum state physically manifesting an abstract graph…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
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…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
We consider the problem of minimizing resources required for universal quantum computation using only projective measurements. The resources we focus on are observables, which describe projective measurements, and ancillary qubits. We show…
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of…
Usually models for quantum computations deal with unitary gates on pure states. In this paper we generalize the usual model. We consider a model of quantum computations in which the state is an operator of density matrix and the gates are…