Related papers: Approximate Consistency and Prediction Algorithms …
The theory of decoherent histories is checked for the requirement of statistical independence of subsystems. Strikingly, this is satisfied only when the decoherence functional is diagonal in both its real a n d imaginary parts. In…
The dynamics of many open quantum systems are described by stochastic master equations. In the discrete-time case, we recall the structure of the derived quantum filter governing the evolution of the density operator conditioned to the…
The method of decoherent histories allows probabilities to be assigned to sequences of quantum events in systems, such as the universe as a whole, where there is no external observer to make measurements. This paper applies the method of…
The problem of the time of arrival of a quantum system in a specified state is considered in the framework of the repeated measurement protocol and in particular the limit of continuous measurements is discussed. It is shown that for a…
A simplified Heisenberg spin model is studied in order to examine the idea of decoherence in closed quantum systems. For this purpose, we present a quantifiable definition to quantum coherence $\Xi$, and discuss in some detail a general…
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
Variational quantum algorithms are the centerpiece of modern quantum programming. These algorithms involve training parameterized quantum circuits using a classical co-processor, an approach adapted partly from classical machine learning.…
In this paper, we extend the standard formalism of quantum mechanics to a quantum theory for a total system including one internal measuring apparatus. The internality of the measuring apparatus implies that different decomposition of a…
The problem of counting the number of models of a given Boolean formula has numerous applications, including computing the leakage of deterministic programs in Quantitative Information Flow. Model counting is a hard, #P-complete problem.…
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…
The central challenge for describing the dynamics in open quantum systems is that the Hilbert space of typical environments is too large to be treated exactly. In some cases, such as when the environment has a short memory time or only…
In a recent study (Ref. [1]), quantum annealing was reported to exhibit a scaling advantage for approximately solving Quadratic Unconstrained Binary Optimization (QUBO). However, this claim critically depends on the choice of classical…
We develop a general technique for proving convergence of repeated quantum interactions to the solution of a quantum stochastic differential equation. The wide applicability of the method is illustrated in a variety of examples. Our main…
The purpose of the paper is to study the foundations of the main axioms of Quantum Mechanics. From a general study of the mathematical properties of the models used in Physics to represent systems, we prove that the states of a system can…
We investigate the performance of a quantum algorithm for solving classical 3-SAT problems. A cycle of post-selected measurements drives the computer's register monotonically toward a steady state which is correlated to the classical…
The quantum Zeno effect is a distinctive phenomenon in quantum mechanics, describing the nontrivial effect of frequent projective measurements on hindering the evolution of a quantum system. However, when subjected to environmental noise,…
We consider discretizations of the Einstein action of general relativity such that the resulting discrete equations of motion form a consistent constrained system. Upon ``spin foam'' quantization of the system, consistency allows a natural…
Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
The quantum measurement problem, understanding why a unique outcome is obtained in each individual experiment, is tackled by solving models. After an introduction we review the many dynamical models proposed over the years. A flexible and…