Related papers: Gottesman Types for Quantum Programs
In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be…
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…
We present a hierarchical viewpoint on the operator-algebraic formulation of quantum systems, in which $C^{*}$-algebras are responsible for the universal and intrinsic description, whereas von Neumann algebras provide the detailed account…
In a way paralleling the recently accepted non-Hermitian version of quantum mechanics in its Schr\"{o}dinger representation (working often with the innovative and heuristically productive concept of ${\cal PT}-$symmetry), it is demonstrated…
We give a formal algebraic description of Josephson-type quantum dynamical systems, i.e., Hamiltonian systems with a cos theta-like potential term. The two-boson Heisenberg algebra plays for such systems the role that the h(1) algebra does…
We determine the ring structure of the equivariant quantum cohomology of the Hilbert scheme of points in the complex plane. The operator of quantum multiplication by the divisor class is a nonstationary deformation of the quantum…
Motivated by a connection, described here for the first time, between the hidden normal subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions of physical particles), we develop a stabilizer formalism using…
This paper discusses quantum algorithms for the generator coordinate method (GCM) that can be used to benchmark molecular systems. The GCM formalism defined by exponential operators with exponents defined through generators of the Fermionic…
This thesis is concerned with the representation theory of the Heisenberg group and its applications to both classical and quantum mechanics. We continue the development of $p$-mechanics which is a consistent physical theory capable of…
We show that the model of quantum computation based on density matrices and superoperators can be decomposed in a pure classical (functional) part and an effectful part modeling probabilities and measurement. The effectful part can be…
In this work we explore the structure of Clifford algebras and the representations of the algebraic spinors in quantum information theory. Initially we present an general formulation through elements of left minimal ideals in tensor…
The formalism of classical and quantum mechanics on phase space leads to symplectic and Heisenberg group representations, respectively. The Wigner functions give a representation of the quantum system using classical variables. The…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…
We present the syntax and rules of deduction of QPEL (Quantum Program and Effect Language), a language for describing both quantum programs, and properties of quantum programs - effects on the appropriate Hilbert space. We show how…
Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near-term. In this…
In this work, we use tools from non-standard analysis to introduce infinite-dimensional quantum systems and quantum fields within the framework of Categorical Quantum Mechanics. We define a dagger compact category *Hilb suitable for the…
A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed…
We introduce a framework for the formal specification and verification of quantum circuits based on the Feynman path integral. Our formalism, built around exponential sums of polynomial functions, provides a structured and natural way of…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
We present the detailed account of the quantum(-like) viewpoint to common knowledge. The Binmore-Brandenburger operator approach to the notion of common knowledge is extended to the quantum case. We develop a special quantum(-like) model of…