Related papers: Complex conjugation supermap of unitary quantum ma…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
We describe the use of quantum process calculus to describe and analyze quantum communication protocols, following the successful field of formal methods from classical computer science. We have extended the quantum process calculus to…
We propose a generalization of the model of classical baker map on the torus, in which the images of two parts of the phase space do overlap. This transformation is irreversible and cannot be quantized by means of a unitary Floquet…
As shown by Abramsky and Coecke, quantum mechanics can be studied in terms of dagger compact closed categories with biproducts. Within this structure, many well-known quantum protocols can be described and their validity can be shown by…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the…
We solve the problem of achieving the optimal physical approximation of the transposition for pure states of arbitrary quantum systems for finite and infinite dimensions. A unitary realization is also given for any finite dimension, which…
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we…
We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…
We study the dynamics of quantum systems interacting with a stream of entangled qubits. Under fairly general conditions, we present a detailed framework describing the conditional dynamical maps for the system, called quantum trajectories,…
The dynamics of open quantum systems is often modelled using master equations, which describe the expected outcome of an experiment (i.e., the average over many realizations of the same dynamics). Quantum trajectories, instead, model the…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…
We explicitly construct an Archimedean order unit space whose state space is affinely isomorphic to the set of quantum commuting correlations. Our construction only requires fundamental techniques from the theory of order unit spaces and…
For a specific quantum chip, multi-programming helps to improve overall throughput and resource utilization. However, the previous solutions for mapping multiple programs onto a quantum chip often lead to resource under-utilization, high…
Studying quantum entanglement in systems of indistinguishable particles, in particular anyons, poses subtle challenges. Here, we investigate a model of one-dimensional anyons defined by a generalized algebra. This algebra has the special…
Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes…
Superposed orders of quantum channels have already been proved - both theoretically and experimentally - to enable unparalleled opportunities in the quantum communication domain. As a matter of fact, superposition of orders can be exploited…
We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how…
Using the properties of quantum superposition, we propose a quantum classification algorithm to efficiently perform multi-class classification tasks, where the training data are loaded into parameterized operators which are applied to the…