Related papers: Pseudo-random operators of the circular ensembles
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…
The paper discusses progress in understanding statistical properties of complex eigenvalues (and corresponding eigenvectors) of weakly non-unitary and non-Hermitian random matrices. Ensembles of this type emerge in various physical…
We analyze the complexity of synthesizing random states and unitary operators in a multi-qudit system in two paradigms. In one case, we consider the situation in which we manipulate the system by applying a sequence of one- and two-qudit…
Here, using two real non-zero parameters $\lambda$ and $\mu$, we construct Gaussian pseudo-orthogonal ensembles of a large number $N$ of $n \times n$ ($n$ even and large) real pseudo-symmetric matrices under the metric $\eta$ using $…
We address the quantum-classical correspondence for chaotic systems with a crossover between symmetry classes. We consider the energy level statistics of a classically chaotic system in a weak magnetic field. The generating function of…
We propose the implementation of Galileo group symmetry operations or, in general, linear coordinate transformations, in a quantum simulator. With an appropriate encoding, unitary gates applied to our quantum system give rise to Galilean…
Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or…
The problem of identifying and reconstructing operators from a diagonal of the Gabor matrix is considered. The framework of Quantum Time--Frequency Analysis is used, wherein this problem is equivalent to the discretisation of the diagonal…
We give a supersymmetric generalization of the sine algebra and the quantum algebra $U_{t}(sl(2))$. Making use of the $q$-pseudo-differential operators graded with a fermionic algebra, we obtain a supersymmetric extension of sine algebra.…
Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…
We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for…
Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno…
Quantum computers are analog devices; thus they are highly susceptible to accumulative errors arising from classical control electronics. Fast operation--as necessitated by decoherence--makes gating errors very likely. In most current…
Exact results from random matrix theory are used to systematically analyse the relationship between microscopic Dirac spectra and finite-volume partition functions. Results are presented for the unitary ensemble, and the chiral analogs of…
Pseudorandom unitaries (PRUs) are ensembles of efficiently implementable unitary operators that cannot be distinguished from Haar random unitaries by any quantum polynomial-time algorithm with query access to the unitary. We present a…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
Electronic transport through chaotic quantum dots exhibits universal, system independent, properties, consistent with random matrix theory. The quantum transport can also be rooted, via the semiclassical approximation, in sums over the…
Quantum chaotic systems exhibit certain universal statistical properties that closely resemble predictions from random matrix theory (RMT). With respect to observables, it has recently been conjectured that, when truncated to a sufficiently…