Related papers: Unitary operator bases as universal averaging sets
The existing notion of the shared entangled state-assisted remote preparation of unitary operator (equivalently the existing notion of quantum remote control) using local operation and classical communication is generalized to a scenario…
Continuous-variable quad-rail lattice cluster states enable flexible quantum circuit design on their two-dimensional structure. However, how to combine basic operations on the quad-rail lattice cluster state to realize multimode operations…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…
We present a possible candidate of construction of a scalable, uniform and universal quantum network, which is built from quantum gates to elements of quantum circuit, again to quantum subnetworks and finally to an entire quantum network.…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
It is well-known that any compact Lie group appears as closed subgroup of a unitary group, $G\subset U_N$. The unitary group $U_N$ has a free analogue $U_N^+$, and the study of the closed quantum subgroups $G\subset U_N^+$ is a problem of…
In this paper, we study the transformations that are obtained in one-way quantum computation on continuous-variable cluster states of various configurations. Of all possible cluster configurations, we choose those that are suitable for…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
When a quantum system interacts with an external environment, it undergoes the loss of quantum correlation (decoherence) and the loss of energy (relaxation) and eventually all of the quantum information becomes classical. Here we show a…
We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary…
It has been shown (Arxiv: quant-ph/0507236) that a universal quantum computer could be powerful enough to solve efficiently the quantum search problem, and the reversible and unitary halting protocol based on the state-locking pulse field…
A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we…
Twirling operations, which average a quantum state with respect to a unitary subgroup, have become a frequently-employed tool in quantum information processing. We investigate the efficient implementation of twirling operations with minimal…
In this paper we provide a method for constructing joint distributions for an arbitrary set of observables on finite dimensional Hilbert spaces irrespective of whether the observables commute or not. These distributions have a number of…
In this paper after defining the abstract concept of compatibility-like functions on quantum states, we prove that every bijective transformation on the set of all states which preserves such a function is implemented by an either unitary…
We construct a family of operator systems and $k$-AOU spaces generated by a finite number of projections satisfying a set of linear relations. This family is universal in the sense that the map sending the generating projections to any…
Quantum process tomography (QPT) methods aim at identifying a given quantum process. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the…
Recently, there has been a growing literature exploring the generalization of quantum algorithms, such that different quantum algorithms are special examples of a more fundamental structure. In this short paper, we provide a general…
At its core a $t$-design is a method for sampling from a set of unitaries in a way which mimics sampling randomly from the Haar measure on the unitary group, with applications across quantum information processing and physics. We construct…