Related papers: Quantum NP and a Quantum Hierarchy
The next few years will be exciting as prototype universal quantum processors emerge, enabling implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
A formulation of quantum mechanics with additive and multiplicative (q-)difference operators instead of differential operators is studied from first principles. Borel-quantisation on smooth configuration spaces is used as guiding…
A key notion bridging the gap between {\it quantum operator algebras} \cite{LZ10} and {\it vertex operator algebras} \cite{Bor}\cite{FLM} is the definition of the commutativity of a pair of quantum operators (see section 2 below). This is…
Integral representations of two $q$-difference operators are provided in terms of special functions arising in the theory of asymptotic solutions to $q$-difference equations in the complex domain. Both representations are unified through…
We review and analyze the hybrid quantum-classical NMR computing methodology referred to as Type-II quantum computing. We show that all such algorithms considered so far within this paradigm are equivalent to some classical…
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a "quantum…
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.…
This paper presents a novel semantics for a quantum programming language by operator algebras, which are known to give a formulation for quantum theory that is alternative to the one by Hilbert spaces. We show that the opposite category of…
In this paper we find a simple rule to reproduce the algebra of quantum observables using only the commutators and operators which appear in the Koopman-von Neumann (KvN) formulation of classical mechanics. The usual Hilbert space of…
In 2004, Aaronson introduced the complexity class $\mathsf{PostBQP}$ ($\mathsf{BQP}$ with postselection) and showed that it is equal to $\mathsf{PP}$. Following their line of work, we introduce two new complexity classes. The first,…
Koopman and von Neumann (KvN) extended the Liouville equation by introducing a phase space function $S^{(K)}(q,p,t)$ whose physical meaning is unknown. We show that a different $S(q,p,t)$, with well-defined physical meaning, may be…
As in classical reversible computing, Quantum Arithmetic is typically seen as a set of tools that process binary data encoded into a quantum register to set the value of another quantum register. This article presents another approach to…
We define a p-norm in the context of quantum random variables, measurable operator-valued functions with respect to a positive operator-valued measure. This norm leads to a operator-valued L^p space that is shown to be complete. Various…
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…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
Real and complex norms of a linear operator acting on a normed complexified space are considered. Bounds on the ratio of these norms are given. The real and complex norms are shown to coincide for four classes of operators: 1) real linear…
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…
We present the detailed account of the quantum(-like) viewpoint to common knowledge. The Binmore-Brandenburger operator approach to the notion of common knowledge is extended to the quantum case. We develop a special quantum(-like) model of…
Experience from seven decades of classical computing suggests that a sustainable computer industry depends on a community of software engineers writing programs to address a wide variety of specific end-user needs, achieving both…