Related papers: Quantum Lakshmibai-Seshadri paths and root operato…
Input-output theory is a well-known tool in quantum optics and ubiquitous in the description of quantum systems probed by light. Owing to the generality of the setup it describes, the theory finds application in a wide variety of…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Quantum walks, the quantum analogue of the classical random walk, have been shown to underpin quantum algorithms for fluid dynamics. We propose the quantum half-adder gate method for quantum walks as a good benchmark algorithm, specifically…
We study transport properties of discrete quantum dynamical systems on the lattice, in particular Coined Quantum Walks and the Chalker--Coddington model. We prove existence of a non trivial charge transport and that the absolutely…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
It is shown that dynamical quantum phase transitions observed as singularities in the Loschmidt rate singularities bear close resemblance to standard Rabi oscillations known from dynamics of two-level systems. For some many-body systems…
Quantum Reduced Loop Gravity is a promising framework for linking Loop Quantum Gravity and the effective semiclassical dynamics of Loop Quantum Cosmology. We review its basic achievements and its main perspectives, outlining how it provides…
The flat FRW model coupled to the massless scalar field according to the improved, background scale independent version of Ashtekar, Pawlowski and Singh is considered. The core of the theory is addressed directly: the APS construction of…
In this paper, we give a complete characterization of Leavitt path algebras which are graded $\Sigma $-$V$ rings, that is, rings over which a direct sum of arbitrary copies of any graded simple module is graded injective. Specifically, we…
By the reduced component in a moduli space of stable quasimaps to n-dimensional projective space we mean the closure of the locus in which the domain curves are smooth. As in the moduli space of stable maps, we prove the reduced component…
We elucidate physical aspects of path signatures by formulating randomised path developments within the framework of matrix models in quantum field theory. Using tools from physics, we introduce a new family of randomised path developments…
We give a simple crystal theoretic interpretation of the Lascoux's expansion of a non-symmetric Cauchy kernel $\prod_{i+ j\leq n+1}(1-x_iy_j)^{-1}$, which is given in terms of Demazure characters and atoms. We give a bijective proof of the…
We establish a formal bridge between qubit-based and photonic quantum computing. We do this by defining a functor from the ZX calculus to linear optical circuits. In the process we provide a compositional theory of quantum linear optics…
Pseudo-random operators consist of sets of operators that exhibit many of the important statistical features of uniformly distributed random operators. Such pseudo-random sets of operators are most useful whey they may be parameterized and…
Quantum algorithms for scientific computing require modules implementing fundamental functions, such as the square root, the logarithm, and others. We require algorithms that have a well-controlled numerical error, that are uniformly…
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number of quantum gates which is polynomial in the…
We study, from a combinatorial viewpoint, the quantized coordinate ring of mxn matrices over an infinite field K (also called quantum matrices) and its torus-invariant prime ideals. The first part of this paper shows that this algebra,…
Quantum circuits are the preferred formalism for expressing quantum information processing tasks. Quantum circuit design automation methods mostly use a waterfall approach and consider that high level circuit descriptions are hardware…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that…
We describe the quantum flat universe in QRLG in terms of states based at cuboidal graphs with six-valent nodes. We investigate the action of the scalar constraint operator at each node and we construct proper semiclassical states. This…