相关论文: Quantum logic as a sum over classical logic gates
Logical inference leads to one of the major interpretations of probability theory called logical interpretation, in which the probability is seen as a measure of the plausibility of a logical statement under incomplete information. In this…
The Feynman path integral plays a crucial role in quantum mechanics, offering significant insights into the interaction between classical action and propagators, and linking quantum electrodynamics (QED) with Feynman diagrams. However, the…
This paper proposed a quantum analogue of classical queue automata by using the definition of the quantum Turing machine and quantum finite-state automata. However, quantum automata equipped with storage medium of a stack has been…
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…
We introduce configuration space path integrals for quantum fields interacting with classical fields. We show that this can be done consistently by proving that the dynamics are completely positive directly, without resorting to master…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
Quantum information and computation may serve as a source of useful axioms and ideas for the quantum logic/quantum structures project of characterizing and classifying types of physical theories, including quantum mechanics and classical…
By investigating the Feynman Path Integral we prove that elementary quantum particle dynamics are directly associated to single compact (cyclic) world-line parameters, playing the role of the particles' internal clock, implicit in ordinary…
The Feynman Path Integral is extended in order to capture all solutions of a quantum field theory. This is done via a choice of appropriate integration cycles, parametrized by M in SL(2,C), i.e., the space of allowed integration cycles is…
Set theory reduces all processes to assembly and disassembly. A similar architecture is proposed for nature as quantum computer. It resolves the classical space-time underlying Feynman diagrams into a quantum network of creation and…
A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…
Quantum gauge theories with finite-dimensional representation spaces are constructed that can have canonical gauge field theories as singular limits. They describe nature as a recursive quantum assembly by iterating Fermi-Dirac…
Efforts to give an improved mathematical meaning to Feynman's path integral formulation of quantum mechanics started soon after its introduction and continue to this day. In the present paper, one common thread of development is followed…
This is a brief overview of quantum holonomies in the context of quantum computation. We choose an adequate set of quantum logic gates, namely, a phase gate, the Hadamard gate, and a conditional-phase gate and show how they can be…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
Quantum mechanical unitarity in our universe is challenged both by the notion of the big bang, in which nothing transforms into something, and the expansion of space, in which something transforms into more something. This motivates the…
The method of using concepts and insight from quantum information theory in order to solve problems in reversible classical computing (introduced in Ref. [1]) have been generalized to irreversible classical computing. The method have been…
Invariance under translation is exploited to efficiently simulate one-dimensional quantum lattice systems in the limit of an infinite lattice. Both the computation of the ground state and the simulation of time evolution are considered.
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
Perturbative quantum field theory usually uses second quantisation and Feynman diagrams. The worldline formalism provides an alternative approach based on first quantised particle path integrals, similar in spirit to string perturbation…