Related papers: Quantum interpretations of AWPP and APP
We derive a version of the so-called "best Fokker-Planck approximation" (BFPA) to describe the spatial properties of interacting active Ornstein-Uhlenbeck particles (AOUPs) in arbitrary spatial dimensions. In doing so, we also take into…
The weakly asymmetric exclusion process (WASEP) in one dimension is a paradigmatic system of interacting particles described by the macroscopic fluctuation theory (MFT) in the presence of driving. We consider an initial condition with…
We study the approximate fixed point property (AFPP) for continuous single-valued functions and for continuous multivalued functions in digital topology. We extend what is known about these notions and discuss errors that have appeared in…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
Analytical complexity of quantum wavefunction whose argument is extended into the complex plane provides an important information about the potentiality of manifesting complex quantum dynamics such as time-irreversibility, dissipation and…
In this paper, we study the computational complexity of the quadratic unconstrained binary optimization (QUBO) problem under the functional problem FP^NP categorization. We focus on four sub-classes: (1) When all coefficients are integers…
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We…
The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…
We sketch and emphasize the automatic emergence of a quantum potential Q in e.g. classical WDW type equations upon inserting a (Bohmian) complex wave function. The interpretation of Q in terms of momentum fluctuations via Fisher information…
This is a pedagogical discussion of the foundations of the quantum theory.
One can construct the model conception of quantum phenomena (MCQP) which relates to the axiomatic conception of quantum phenomena (ACQP), (i.e. to the conventional quantum mechanics) in the same way, as the statistical physics relates to…
In classical cryptography, one-way functions (OWFs) are the minimal assumption, while it is not the case in quantum cryptography. Several new primitives have been introduced such as pseudorandom state generators (PRSGs), one-way state…
We compare the complexity of the search and decision problems for the complexity class S2P. While Cai (2007) showed that the decision problem is contained in ZPP^NP, we show that the search problem is equivalent to TFNP^NP, the class of…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
It is the matter of fact that quantum mechanics operates with notions that are not determined in the frame of the mechanics' formalism. Among them we can call the notion of "wave-particle" (that, however, does not appear in both classical…
Quantum physics modeling is technically complex and often non-descriptive. This article presents some approaches how quantum physical ideas can be represented by haptic models. For this purpose, models made from 3D printers, models made…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a…
In CPM 2017, Amir et al. introduce a problem, named \emph{approximate string cover} (\textbf{ACP}), motivated by many aplications including coding and automata theory, formal language theory, combinatorics and molecular biology. A…
This work studies optimal polynomial approximants (OPAs) in the classical Hardy spaces on the unit disk, $H^p$ ($1 < p < \infty$). For fixed $f\in H^p$ and $n\in\mathbb{N}$, the OPA of degree $n$ associated to $f$ is the polynomial which…