Related papers: Quantum interpretations of AWPP and APP
Aaronson, Bouland, Fitzsimons and Lee introduced the complexity class PDQP (which was original labeled naCQP), an alteration of BQP enhanced with the ability to obtain non-collapsing measurements, samples of quantum states without…
The role of the Equivalence Principle (EP) in classical and quantum mechanics is reviewed. It is shown that the weak EP has a counterpart in quantum theory, a Quantum Equivalence Principle (QEP). This implies that also in the quantum domain…
Let $p\in [1,\infty)$. We define an $L^p$-operator algebra crossed product by a transfer operator for the topological Bernoulli shift $\varphi$ on $X=\{1,...,n\}^{\mathbb{N}}$, and we prove it is isometrically isomorphic to the $L^p$-analog…
A conceptual difficulty in the foundations of quantum mechanics is the quantum measurement problem (QMP), essentially concerned with the apparent non-unitarity of the measurement process and the classicality of macroscopic systems. In an…
In [11], Newton da Costa together with the author of this paper argued in favor of the possibility to consider quantum superpositions in terms of a paraconsistent approach. We claimed that, even though most interpretations of quantum…
Starting from a recently-introduced algebraic structure on spin foam models, we define a Hopf algebra by dividing with an appropriate quotient. The structure, thus defined, naturally allows for a mirror analysis of spin foam models with…
The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers.…
We present a representation for linguistic structure that we call a Fock-space representation, which allows us to embed problems in language processing into small quantum devices. We further develop a formalism for understanding both…
What is the nature of reality? How should be an answer to this question? At this level, we are so deep that all our concepts are obscure. Quantum theory (QT) is at this level. The quest for interpreting it fails because the clarity of our…
This is the second of the two related papers analysing origins and possible explanations of a paradoxical phenomenon of the quantum potential (QP). It arises in quantum mechanics'(QM) of a particle in the Riemannian $n$-dimensional…
We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let $f$ be an $m$-bit Boolean function and consider an $n$-bit function $F$ obtained by applying $f$ to conjunctions of…
{\em Quantum Fourier analysis} is a new subject that combines an algebraic Fourier transform (pictorial in the case of subfactor theory) with analytic estimates. This provides interesting tools to investigate phenomena such as quantum…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…
Flum and Grohe define a parameter (parameterization) as a function $\kappa$ which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time computable. We show how this technical restriction can…
We explain the mechanism of the quantum speed-up - quantum algorithms requiring fewer computation steps than their classical equivalent - for a family of algorithms. Bob chooses a function and gives to Alice the black box that computes it.…
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…
The Fermi g_F(x,p) function provides a phase space description of quantum mechanics conceptually different from that based on the the Wigner function W(x,p). In this paper, we show that for a peaked wave packet the g_F(x,p)=0 curve…
We study ROUND-UFP and ROUND-SAP, two generalizations of the classical BIN PACKING problem that correspond to the unsplittable flow problem on a path (UFP) and the storage allocation problem (SAP), respectively. We are given a path with…
One of the central problems in quantum mechanics is to determine the ground state properties of a system of electrons interacting via the Coulomb potential. Since its introduction by Hohenberg, Kohn, and Sham, Density Functional Theory…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…