Related papers: A Factor-Graph Representation of Probabilities in …
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
A novel approach to parton distributions parameterization in terms of quantum statistical functions is here outlined. The description, already proposed in previous publications, is here improved by adding to the statistical distributions an…
The mathematical formalism of Quantum Mechanics is derived or "reconstructed" from more basic considerations of probability theory and information geometry. The starting point is the recognition that probabilities are central to QM: the…
Modern day quantum simulators can prepare a wide variety of quantum states but the accurate estimation of observables from tomographic measurement data often poses a challenge. We tackle this problem by developing a quantum state tomography…
{\em Quantum Fourier analysis} is a new subject that combines an algebraic Fourier transform (pictorial in the case of subfactor theory) with analytic estimates. This provides interesting tools to investigate phenomena such as quantum…
This paper delves into the significance of the tomographic probability density function (pdf) representation of quantum states, shedding light on the special classes of pdfs that can be tomograms. Instead of using wave functions or density…
We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity…
In this article the geometry of quantum gravity is quantized in the sense of being noncommutative (first quantization) but it is also quantized in the sense of being emergent (second quantization). A new mechanism for quantum geometry is…
We study the transmission of a quantum particle along a straight input--output line to which a graph $\Gamma$ is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant…
The additivity of classical probabilities is only the first in a hierarchy of possible sum-rules, each of which implies its successor. The first and most restrictive sum-rule of the hierarchy yields measure-theory in the Kolmogorov sense,…
The question about the existence of so-called ``hidden'' variables in quantum mechanics and the perception of the completeness of quantum mechanics are two sides of the same coin. Quantum analytical mechanics constitutes a completion of…
A new class of stochastic variables, governed by a specifice set of rules, is introduced. These rules force them to loose some properties usually assumed for this kind of variables. We demonstrate that stochastic processes driven by these…
We examine the visualization of quantum mechanics in phase space by means of the Wigner function and the Wigner function flow as a complementary approach to illustrating quantum mechanics in configuration space by wave functions. The Wigner…
Quantum computing is currently gaining significant attention, not only from the academic community but also from industry, due to its potential applications across several fields for addressing complex problems. For any practical problem…
An extension of the Born rule, the {\it quantum typicality rule}, has recently been proposed [B. Galvan: Found. Phys. 37, 1540-1562 (2007)]. Roughly speaking, this rule states that if the wave function of a particle is split into…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
Lifting exploits symmetries in probabilistic graphical models by using a representative for indistinguishable objects, allowing to carry out query answering more efficiently while maintaining exact answers. In this paper, we investigate how…
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key quantity of interest is the mutual information between the…
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of…