Related papers: Characterization of quantum states in predicative …
A general principle of `causal duality' for physical systems, lying at the base of representation theorems for both compound and evolving systems, is proved; formally it is encoded in a quantaloidal setting. Other particular examples of…
Loop quantum cosmology is shown to provide both the dynamical law and initial conditions for the wave function of a universe by one discrete evolution equation. Accompanied by the condition that semiclassical behavior is obtained at large…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.
The lack of information obtained from informationally incomplete quantum measurements can prevent the detection of quantum resources, such as optical nonclassicality. We develop a technique that overcomes this limitation for single-mode…
The paper investigates the epistemic conception of quantum states---the view that quantum states are not descriptions of quantum systems but rather reflect the assigning agents' epistemic relations to the systems. This idea, which can be…
We discuss and implement experimentally a method for characterizing quantum gates operating on superpositions of coherent states. The peculiarity of this encoding of qubits is to work with a non-orthogonal basis, and therefore some…
First order phase transitions are ubiquitous in nature, however, this notion is ambiguous and highly debated in the case of quantum systems out of thermal equilibrium. We construct a paradigmatic example which allows for elucidating the key…
In deterministic theories, one can start from a set of ontological states to formulate the dynamical laws, but these may not be directly observable. Observable are only equivalence classes of states, and these will span a basis of…
In a previous preprint (quant-ph/0012122) we introduced a ``contextual objectivity" formulation of quantum mechanics (QM). A central feature of this approach is to define the quantum state in physical rather than in mathematical terms, in…
The notion of ontological states is introduced here with reference to the Cellular Automaton Interpretation of Quantum Mechanics proposed by G.'t Hooft. A class of discrete deterministic "Hamiltonian" Cellular Automata is defined that has…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
In these two related parts we present a set of methods, analytical and numerical, which can illuminate the behaviour of quantum system, especially in the complex systems. The key points demonstrating advantages of this approach are: (i)…
We give a rigorous treatment on the foundation of the first order asymptotic theory of quantum estimation, with tractable and reasonable regularity conditions. Different from past works, we do not use Fisher information nor MLE, and an…
Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…
Quantum state discrimination underlies various applications in quantum information processing tasks. It essentially describes the distinguishability of quantum systems in different states, and the general process of extracting classical…
We study emerging notions of quantum correlations in compound systems. Based on different definitions of quantumness in individual subsystems, we investigate how they extend to the joint description of a composite system. Especially, we…
A quantum state can be understood in a loose sense as a map that assigns a value to every observable. Formalizing this characterization of states in terms of generalized probability distributions on the set of effects, we obtain a simple…
We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of…
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…