Related papers: Approximate Consistency and Prediction Algorithms …
An interpretation and re-formulation of modern physics which removes the presumption of the space-time continuum, and bases physical theory on a small number of rational and empirical principles. After briefly describing the philosophical…
Some ideas from quantum theory are just beginning to percolate back to classical probability theory. For example, there is a widely used and successful theory of "chemical reaction networks", which describes the interactions of molecules in…
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…
Quantum mechanics provides a statistical description about nature, and thus would be incomplete if its statistical predictions could not be accounted for some realistic models with hidden variables. There are, however, two powerful theorems…
The (consistent or decoherent) histories interpretation provides a consistent realistic ontology for quantum mechanics, based on two main ideas. First, a logic (system of reasoning) is employed which is compatible with the Hilbert-space…
Optimization under uncertainty and risk is indispensable in many practical situations. Our paper addresses stability of optimization problems using composite risk functionals which are subjected to measure perturbations. Our main focus is…
Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations…
This paper discusses the relation between the decoherent histories approach to quantum mechanics that is based on coarse-grained decoherent histories of a closed system, and the approximate quantum mechanics of measured subsystems, as in…
Mutual coherence is a measure of similarity between two opinions. Although the notion comes from philosophy, it is essential for a wide range of technologies, e.g., the Wahl-O-Mat system. In Germany, this system helps voters to find…
We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the…
The basic ingredients of the `consistent histories' approach to quantum theory are a space $\UP$ of `history propositions' and a space $\D$ of `decoherence functionals'. In this article we consider such history quantum theories in the case…
Decoherence and einselection have been effective in explaining several features of an emergent classical world from an underlying quantum theory. However, the theory assumes a particular factorization of the global Hilbert space into…
We review recent progress in attaining a quantitative understanding of the scarring phenomenon, the non-random behavior of quantum wavefunctions near unstable periodic orbits of a classically chaotic system. The wavepacket dynamics…
Motivated by the recent contribution \cite{BB17} we study the scaling limit behavior of a class of one-dimensional stochastic differential equations which has a unique attracting point subject to a small additional repulsive perturbation.…
Ernst Specker considered a particular feature of quantum theory to be especially fundamental, namely that pairwise joint measurability of sharp measurements implies their global joint measurability (https://vimeo.com/52923835). To date,…
We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…
Quantum computers are believed to have the ability to process huge data sizes which can be seen in machine learning applications. In these applications, the data in general is classical. Therefore, to process them on a quantum computer,…
In this paper, we present long-awaited algorithmic advances toward the efficient construction of near-optimal replenishment policies for a true inventory management classic, the economic warehouse lot scheduling problem. While this paradigm…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning…