Related papers: Computational Complexity of Quantum Satisfiability
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…
We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a lattice-embedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic…
The problem of time evolution in quantum cosmology is studied in the context of a dust-filled, spatially flat Friedmann-Robertson-Walker universe. In this model, two versions of the commonly-adopted notion of internal time can be…
Probably the simplest and most frequently used way to illustrate the power of quantum computing is to solve the so-called {\it Deutsch's problem}. Consider a Boolean function $f: \{0,1\} \to \{0,1\}$ and suppose that we have a (classical)…
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic…
According to what has become a standard history of quantum mechanics, in 1932 von Neumann persuaded the physics community that hidden variables are impossible as a matter of principle, after which leading proponents of the Copenhagen…
This paper formally proposes a problem about the efficient utilization of the four dimensional space-time. Given a cuboid container, a finite number of rigid cuboid items, and the time length that each item should be continuous baked in the…
Similarities between the non-deterministic nature of quantum theory and the unpredictable patterns of human cognition and decision making have been observed and commented on many times since the invention of Quantum Mechanics in the first…
The main obstacle in attempts to construct a consistent quantum gravity is the absence of independent flat time. This can in principle be cured by going out to higher dimensions. The modern paradigm assumes that the fundamental theory of…
Besides their use for efficient computation, quantum computers are a base for studying quantum systems that create valid physical theories using mathematics and physics. An essential part of the validation process for quantum mechanics is…
If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting…
Motivated by the idea that consistent quantum field theories should admit a finite description, we investigate the complexity of effective field theories using the framework of effective o-minimality. Our focus is on quantifying the…
There are inherent limits in classical computation for it to serve as an adequate model of human cognition. In particular, non-commutativity, while ubiquitous in physics and psychology, cannot be sufficiently handled. We propose that we…
The configuration space of general relativity is superspace - the space of all Riemannian 3-metrics modulo diffeomorphisms. However, it has been argued that the configuration space for gravity should be conformal superspace - the space of…
We describe a categorical model of MALL (Multiplicative Additive Linear Logic) inspired by the Heisenberg-Schr\"odinger duality of finite-dimensional quantum theory. Proofs of formulas with positive logical polarity correspond to CPTP…
Physical interpretations of the time-symmetric formulation of quantum mechanics, due to Aharonov, Bergmann, and Lebowitz are discussed in terms of weak values. The most direct, yet somewhat naive, interpretation uses the time-symmetric…
The concept of space-bounded computability has become significantly important in handling vast data sets on memory-limited computing devices. To replenish the existing short list of NL-complete problems whose instance sizes are dictated by…
We present a simplified proof of the von Neumann's Quantum Ergodic Theorem. This important result was initially published in german by J. von Neumann in 1929. We are interested here in the time evolution $\psi_t$, $t\geq 0$, (for large…
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between…