相关论文: Quantum Period Query Proves NP in BQP

We define a new category of quantum polynomial functors extending the quantum polynomials introduced by Hong and Yacobi. We show that our category has many properties of the category of Hong and Yacobi and is the natural setting in which…

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.…

A recent Letter by Wadhia et al. reports a realization of a quantum clock using a double quantum dot (DQD) [Phys. Rev. Lett. 135, 200407 (2005)]. This Comment identifies two fundamental issues: (I) the claimed ``quantum clock" exhibits only…

The application of quantum computation to accelerate machine learning algorithms is one of the most promising areas of research in quantum algorithms. In this paper, we explore the power of quantum learning algorithms in solving an…

We present a semi-algorithm which for any irreducible $p\in\mathbb{K}[x,y]$ finds all elements of $\mathbb{K}(x) + \mathbb{K}(y)$ that are of the form $qp$ for some $q\in\mathbb{K}(x,y)$ whose denominator is not divisible by $p$.

An attempt is made to construct composable composite entropy with different $q$ indices of subsystems and address the H-theorem problem of the composite system. Though the H-theorem does not hold in general situations, it is shown that some…

We initiate the study of the relationship between two complexity classes, BQP (Bounded-Error Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument, Directed). We first give a conjecture that PPAD is contained in BQP, and show a…

A quantum particle on a circle in a quadratic potential exhibits a spectrum that is not harmonic, despite having all algebraic properties of the quantum harmonic oscillator. This raises the question where the usual algebraic argument --…

A query performance predictor estimates the retrieval effectiveness of an IR system for a given query. An important characteristic of QPP evaluation is that, since the ground truth retrieval effectiveness for QPP evaluation can be measured…

The aim of this paper is to pursue the investigation of the phase retrieval problem for the fractional Fourier transform $\ff\_\alpha$ started by the second author. We here extend a method of A.E.J.M Janssen to show that there is a…

We show via an explicit example that quantum anomalies can lead to decoherence of a single quantum qubit through phase relaxation. The anomaly causes the Hamiltonian to develop a non-self-adjoint piece due to the non-invariance of the…

Quantum matter in quantum space-time is discussed using general properties of energy-conservation laws. As a rather radical conclusion, it is found that standard methods of differential geometry and quantum field theory on curved space-time…

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

We develop from scratch a theory of invariants within the framework of non-commutative geometry. Given an operator Q (a supercharge in physics language) and an operator a (whose square equals the identity I), we derive a general formula for…

The charmonium-nucleon effective central interactions have been computed by the time-dependent HAL QCD method. This gives an updated result of a previous study based on the time-independent method, which is now known to be problematic…

We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…

The element distinctness problem is the problem of determining whether the elements of a list are distinct, that is, if $x=(x_1,...,x_N)$ is a list with $N$ elements, we ask whether the elements of $x$ are distinct or not. The solution in a…

For a class of polynomial non-autonomous differential equations of degree n, we use phase plane analysis to show that each equation in this class has n periodic solutions. The result implies that certain rigid two-dimensional systems have…

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…

A recently introduced discrete formalism allows to solve the problem of time in quantum gravity in a relational manner. Quantum mechanics formulated with a relational time is not exactly unitary and implies a fundamental mechanism for…