Related papers: The Logic of Quantum Programs
We survey several problems related to logical aspects of quantum structures. In particular, we consider problems related to completions, decidability and axiomatizability, and embedding problems. The historical development is described, as…
Quantum entanglement and decoherence are the two counterforces of many quantum technologies and protocols. For example, while quantum teleportation is fueled by a pair of maximally entangled resource qubits, it is vulnerable to decoherence.…
A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits. The…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is…
Continuous-variable quantum computing utilizes continuous parameters of a quantum system to encode information, promising efficient solutions to complex problems. Trapped-ion systems provide a robust platform with long coherence times and…
Quantum computers hold the promise to solve certain computational task much more efficiently than classical computers. We review the recent experimental advancements towards a quantum computer with trapped ions. In particular, various…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We discuss the criteria for teleporting coherent states from simple considerations about information exchange during the teleportation process.
We initiate the study of parallel quantum programming by defining the operational and denotational semantics of parallel quantum programs. The technical contributions of this paper include: (1) find a series of useful proof rules for…
The rapid progress of computer technology has been accompanied by a corresponding evolution of software development, from hardwired components and binary machine code to high level programming languages, which allowed to master the…
I revisit the ideas underlying dynamical decoupling methods within the framework of quantum information processing, and examine their potential for direct implementations in terms of encoded rather than physical degrees of freedom. The…
An explicit quantum circuit is given to implement quantum teleportation. This circuit makes teleportation straightforward to anyone who believes that quantum computation is a reasonable proposition. It could also be genuinely used inside a…
The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states…
We present simplification schemes for probabilistic and controlled teleportation of the unknown quantum states of both one-particle and two-particle and construct efficient quantum logic networks for implementing the new schemes by means of…
How useful is a quantum dynamical operation for quantum information processing? Motivated by this question we investigate several strength measures quantifying the resources intrinsic to a quantum operation. We develop a general theory of…
Quantum information is a useful resource to set up information processing. Despite physical components are normally two-level systems, their combination with entangling interactions becomes in a complex dynamics. Studied for piecewise field…
We consider quantum computer architectures where interactions are mediated between hot qubits that are not in their mechanical ground state. Such situations occur, e.g., when not cooling ideally, or when moving ions or atoms around. We…
Quantum computations operate in the quantum world. For their results to be useful in any way, there is an intrinsic necessity of cooperation and communication controlled by the classical world. As a consequence, full formal descriptions of…
Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and…