Related papers: Random Quantum Operations
We consider a sequence of finite quantum graphs with few loops, so that they converge, in the sense of Benjamini-Schramm, to a random infinite quantum tree. We assume these quantum trees are spectrally delocalized in some interval $I$, in…
We present a benchmarking protocol for universal quantum computers, achieved through the simulation of random dynamical quantum maps. This protocol provides a holistic assessment of system-wide error rates, encapsulating both gate…
The central principle of affine quantum gravity is securing and maintaining the strict positivity of the matrix $\{\hg_{ab}(x)\}$ composed of the spatial components of the local metric operator. On spectral grounds, canonical commutation…
Universality of quantum mechanics -- its applicability to physical systems of quite different nature and scales -- indicates that quantum behavior can be a manifestation of general mathematical properties of systems containing…
The quantum principle of relativity (QPR) puts forward an ambitious idea: extend special relativity with a formally superluminal branch of Lorentz-type maps, and treat the resulting consistency constraints as hints about why quantum theory…
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any…
The random matrix ensembles (RME) of Hamiltonian matrices, e.g. Gaussian random matrix ensembles (GRME) and Ginibre random matrix ensembles (Ginibre RME), are applicable to following quantum statistical systems: nuclear systems, molecular…
Students in quantum mechanics class are taught that the wave function contains all knowable information about an isolated system. Later in the course, this view seems to be contradicted by the mysterious density matrix, which introduces a…
Quantum mechanics is derived from the principle that the universe contain as much variety as possible, in the sense of maximizing the distinctiveness of each subsystem. The quantum state of a microscopic system is defined to correspond to…
We second quantize the Fermi Lagrangian in the Lorenz gauge to obtain a covariant theory of photon quantum mechanics. Number density is real so it is interpreted as position probability density. The Hilbert space is the vector space of…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…
A set of quantum states, dynamically related to the classical periodic orbits of a chaotic map, is used as a basis in which the description of the eigenstates of its quantum version is greatly simplified. This set can be improved with the…
Given a quantum system consisting of many parts, we show that symmetry of the system's state, i.e., invariance under swappings of the subsystems, implies that almost all of its parts are virtually identical and independent of each other.…
We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. Consequently, we generalize quantum supermaps to arbitrary monoidal categories and operational…
The eigenvalues of quantum chaotic systems have been conjectured to follow, in the large energy limit, the statistical distribution of eigenvalues of random ensembles of matrices of size $N\rightarrow\infty$. Here we provide semiclassical…
We study how certain invariants of numerical semigroups relate to the number of second kind gaps. Furthermore, given two fixed non-negative integers F and k, we provide an algorithm to compute all the numerical semigroups whose Frobenius…
The probability operator is derived from first principles for an equilibrium quantum system. It is also shown that the superposition states collapse into a mixture of states giving the conventional von Neumann trace form for the quantum…
Classical matching theory can be defined in terms of matrices with nonnegative entries. The notion of Positive operator, central in Quantum Theory, is a natural generalization of matrices with nonnegative entries. Based on this point of…
We present a polynomial-time quantum algorithm for obtaining the energy spectrum of a physical system, i.e. the differences between the eigenvalues of the system's Hamiltonian, provided that the spectrum of interest contains at most a…
Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true…