Related papers: Deduction, Ordering, and Operations in Quantum Log…
We propose an algebraic formulation for two distinct quantum algorithms: a quantum classification algorithm and a quantum search algorithm with a non-uniform initial distribution, both based on Clifford algebras and spinorial…
In the study of open quantum systems modeled by a unitary evolution of a bipartite Hilbert space, we address the question of which parts of the environment can be said to have a "classical action" on the system, in the sense of acting as a…
In this paper we analyze and discuss the historical and philosophical development of the notion of logical possibility focusing on its specific meaning in classical and quantum mechanics. Taking into account the logical structure of quantum…
Different approaches are compared to formulation of quantum mechanics of a particle on the curved spaces. At first, the canonical, quasi-classical and path integration formalisms are considered for quantization of geodesic motion on the…
While many classical algorithms rely on Laplace transforms, it has remained an open question whether these operations could be implemented efficiently on quantum computers. In this work, we introduce the Quantum Laplace Transform (QLT),…
In this paper, we provide a comprehensive overview of a recent debate over the quantum versus classical solvability of bounded distance decoding (BDD). Specifically, we review the work of Eldar and Hallgren [EH22], [Hal21] demonstrating a…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
We present a way to apply quantum logic to the study of quantum programs. This is made possible by using an extension of the usual propositional language in order to make transformations performed on the system appear explicitly. This way,…
Quantum logic gates can perform calculations much more efficiently than their classical counterparts. However, the level of control needed to obtain a reliable quantum operation is correspondingly higher. In order to evaluate the…
A general `quantum history theory' can be characterised by the space of histories and by the space of decoherence functionals. In this note we consider the situation where the space of histories is given by the lattice of projection…
Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices…
We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for…
We construct lattice gauge theories in which the elements of the link matrices are represented by non-commuting operators acting in a Hilbert space. These quantum link models are related to ordinary lattice gauge theories in the same way as…
The syntactic nature of logic and computation separates them from other fields of mathematics. Nevertheless, syntax has been the only way to adequately capture the dynamics of proofs and programs such as cut-elimination, and the finiteness…
Quantum information has become a powerful tool for probing the structure of quantum field theories, yet its application to gauge theories remains subtle. On the one hand, quantum information theory assumes subsystem locality, i.e.~the…
General relativity and quantum mechanics are incompatible at the Planck scale. This contention can be examined if a quantum computer is set to operate at a rate that exceeds the classical limit of one operation per Planck volume-time, or…
The present paper demonstrates the failure of the principle of excluded middle (PEM) in the lattice of all closed linear subspaces of a Hilbert space (usually defined as quantum logic). Namely, it is shown that for a qubit, a proposition…
A certain generalization of the mathematical formalism of quantum mechanics beyond operator algebras is considered. The approach is based on the concept of conditional probability and the interpretation of the Lueders - von Neumann quantum…
The classification of big data usually requires a mapping onto new data clusters which can then be processed by machine learning algorithms by means of more efficient and feasible linear separators. Recently, Lloyd et al. have advanced the…
Quantum operations (QO) describe any state change allowed in quantum mechanics, such as the evolution of an open system or the state change due to a measurement. We address the problem of which unitary transformations and which observables…