Related papers: Bayesian retrodiction of quantum supermaps
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing…
We propose a generalization of the model of classical baker map on the torus, in which the images of two parts of the phase space do overlap. This transformation is irreversible and cannot be quantized by means of a unitary Floquet…
In an ideal setting for Bayesian agents, a perfect description of the rules of the environment (i.e., the objective observation model) is available, allowing them to reason through the Bayesian posterior to update their beliefs in an…
The quantization of the continous cat maps on the torus has led to rather pathological quantum objects [6]. The non-generic behaviour of this model has led some to conclude that the Correspondence Principle fails in this case [2]. In this…
We investigate the evolution of open quantum systems in the presence of initial correlations with an environment. Here the standard formalism of describing evolution by completely positive trace preserving (CPTP) quantum operations can fail…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
According to Quantum Darwinism, system-environment interactions both einselect particular system properties and encode them redundantly in many independent subsets of the environment, called fragments. This redundancy implies that an…
An overview is given of Bayesian inversion and regularization procedures. In particular, the conceptual basis of the maximum entropy method (MEM) is discussed, and extensions to positive/negative and complex data are highlighted. Other…
A Bayesian approach is developed to determine quantum mechanical potentials from empirical data. Bayesian methods, combining empirical measurements and "a priori" information, provide flexible tools for such empirical learning problems. The…
In this paper, we propose an alternative for routing based packet forwarding, which uses network coding to increase transmission efficiency, in terms of both compression and error resilience. This non-adaptive encoding is called quantized…
In the reductionistic approach, mechanisms are divided into simpler parts interconnected in some standard way (e.g. by a mechanical transmission). We explore the possibility of porting reductionism in quantum operations. Conceptually, first…
Loss-based updating, including generalized Bayes, Gibbs, and quasi-posteriors, replaces likelihoods by a user-chosen loss and produces a posterior-like distribution via exponential tilt. We give a decision-theoretic characterization that…
Quantum process tomography is often used to completely characterize an unknown quantum process. However, it may lead to an unphysical process matrix, which will cause the loss of information respect to the tomography result. Convex…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
Bayesian models provide recursive inference naturally because they can formally reconcile new data and existing scientific information. However, popular use of Bayesian methods often avoids priors that are based on exact posterior…
Memory effects in open quantum dynamics are often incorporated in the equation of motion through a superoperator known as the memory kernel, which encodes how past states affect future dynamics. However, the usual prescription for…
A quantum channel is defined as being completely positive (CP) and trace preserving (TP). While not every quantum channel is invertible or reversible, every quantum channel admits various kinds of generalized inverses such as the…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
A hierarchical, reversible mapping between levels of tree structured computation, applicable for structuring the Quantum Computation algorithm for NP-complete problem is presented. It is proven that confining the state of a quantum computer…
The quantum superposition principle is reexamined and reformulated based on the adiabatic theorem of quantum mechanics, nonadiabatic dressed states and experimental evidences. The collapse of the wave function and the quantum measurement…