Related papers: Approximate Consistency and Prediction Algorithms …
The basic ingredients of the `consistent histories' approach to a generalized quantum theory are `histories'and decoherence functionals. The main aim of this program is to find and to study the behaviour of consistent sets associated with a…
In a recent paper Kent has pointed out that in consistent histories quantum theory it is possible, given initial and final states, to construct two different consistent families of histories, in each of which there is a proposition that can…
A resolution of the quantum measurement problem(s) using the consistent histories interpretation yields in a rather natural way a restriction on what an observer can know about a quantum system, one that is also consistent with some results…
Quantum criticality in the presence of strong quenched randomness remains a challenging topic in modern condensed matter theory. We show that the topology and anomaly associated with average symmetry can be used to predict certain…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
The possible effect of environment on the efficiency of a quantum algorithm is considered explicitely. It is illustrated through the example of Shor's prime factorization algorithm that this effect may be disastrous. The influence of…
In this work, we aim at augmenting the decisions output by quantum models with "error bars" that provide finite-sample coverage guarantees. Quantum models implement implicit probabilistic predictors that produce multiple random decisions…
Mathematical models of quantum computers such as a multidimensional quantum Turing machine and quantum circuits are described and its relations with lattice spin models are discussed. One of the main open problems one has to solve if one…
The Consistent Histories (CH) formalism aims at a quantum mechanical framework which could be applied even to the universe as a whole. CH stresses the importance of histories for quantum mechanics, as opposed to measurements, and maintains…
We continue our efforts to understand, within the framework of the quantum mechanics of the universe as a whole, the quasiclassical realm of familiar experience as a feature emergent from the Hamiltonian of the elementary particles and the…
Traditional interpretations of quantum theory in terms of wave function collapse are particularly unappealing when considering the universe as a whole, where there is no clean separation between classical observer and quantum system and…
This paper focuses on investigating an inexact stochastic model-based optimization algorithm that integrates preconditioning techniques for solving stochastic composite optimization problems. The proposed framework unifies and extends the…
We present a framework that provides deterministic consistency algorithms for given memory models. Such an algorithm checks whether the executions of a shared-memory concurrent program are consistent under the axioms defined by a model. For…
The interplay between supersymmetry and classical and quantum computation is discussed. First, it is shown that the problem of computing the Witten index of $\mathcal N \leq 2$ quantum mechanical systems is $\#P$-complete and therefore…
We present a simple recipe to construct exactly and quasi-exactly solvable Hamiltonians in one-dimensional `discrete' quantum mechanics, in which the Schr\"{o}dinger equation is a difference equation. It reproduces all the known ones whose…
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
Within quantum information, many methods have been proposed to avoid or correct the deleterious effects of the environment on a system of interest. In this work, expanding on our earlier paper [G. A. Paz-Silva et al., Phys. Rev. Lett. 108,…
Decoherent histories quantum theory is reformulated with the assumption that there is one "real" fine-grained history, specified in a preferred complete set of sum-over-histories variables. This real history is described by embedding it in…
Constrained optimization problems are ubiquitous in science and industry. Quantum algorithms have shown promise in solving optimization problems, yet none of the current algorithms can effectively handle arbitrary constraints. We introduce…