相关论文: Graph state basis for Pauli Channels

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…

Measuring the state of quantum computers is a highly non-trivial task, with implications for virtually all quantum algorithms. We propose a novel scheme where identical copies of a quantum state are measured jointly so that all Pauli…

Many-body quantum states, as a matter of fact, are extremely essential to solve certain mathematical problems or simulate quantum systems in measurement-based quantum computation. However, how to verify large scale quantum states, such as…

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…

We present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum…

Since a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential…

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…

We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…

We present the construction of a new family of coherent states for quantum theories of connections obtained following the polymer quantization. The realization of these coherent states is based on the notion of graph change, in particular…

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum…

We present two quantum state sharing protocols where the channels are not maximally entangled states. By properly choosing the measurement basis it is possible to achieve unity fidelity transfer of the state if the parties collaborate. We…

We develop an algorithm to apply the Dalgarno-Lewis (DL) perturbation theory to quantum graphs with multiple, connected edges. We use it to calculate the nonlinear optical hyperpolarizability tensors for graphs and show that it replicates…

As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient…

With the advance of quantum information technology, the question of how to most efficiently test quantum circuits is becoming of increasing relevance. Here we introduce the statistics of lengths of measurement sequences that allows one to…

We investigate the problem of compiling the generation of graph states to arbitrarily many distributed homogeneous quantum processing units (QPUs), providing a scalable partitioning algorithm and graph state generation protocol to minimize…

This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…

In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for this information transmission problem. The system involves a source coding…

Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which…

We propose an extension to the Pauli stabiliser formalism that includes fractional $2\pi/N$ rotations around the $Z$ axis for some integer $N$. The resulting generalised stabiliser formalism - denoted the XP stabiliser formalism - allows…

We study the super dense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and non-unitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The super…