Related papers: Direct dialling of Haar random unitary matrices
Gluing theorem for random unitaries [Schuster, Haferkamp, Huang, QIP 2025] have found numerous applications, including designing low depth random unitaries [Schuster, Haferkamp, Huang, QIP 2025], random unitaries in ${\sf QAC0}$ [Foxman,…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and other kernel based learning algorithms. We extend this line…
A diagrammatic method is presented for averaging over the circular ensemble of random-matrix theory. The method is applied to phase-coherent conduction through a chaotic cavity (a ``quantum dot'') and through the interface between a normal…
Quantum computing aims at exploiting quantum phenomena to efficiently perform computations that are unfeasible even for the most powerful classical supercomputers. Among the promising technological approaches, photonic quantum computing…
This is a tutorial on some basic non-asymptotic methods and concepts in random matrix theory. The reader will learn several tools for the analysis of the extreme singular values of random matrices with independent rows or columns. Many of…
This article is an introductory review of random matrix theory (RMT) and its applications, with special focus on quantum chaos. Random matrices were first used by Wigner to understand the spectra of complex nuclei from a statistical…
Basic properties of cold Bose atoms in optical lattices are reviewed. The main principles of correct self-consistent description of arbitrary systems with Bose-Einstein condensate are formulated. Theoretical methods for describing regular…
Recent theoretical studies of chaotic scattering have encounted ensembles of random matrices in which the eigenvalue probability density function contains a one-body factor with an exponent proportional to the number of eigenvalues. Two…
Random projections have proven extremely useful in many signal processing and machine learning applications. However, they often require either to store a very large random matrix, or to use a different, structured matrix to reduce the…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…
We develop uniformly fast random variate generators for the Pearson IV distribution that can be used over the entire range of both shape parameters and highlight some applications in a Bayesian setting.
Quantum simulation in its current state faces experimental overhead in terms of physical space and cooling. We propose boson sampling as an alternative compact synthetic platform performing at room temperature. Identifying the capability of…
Discrimination of unitary operations is a fundamental quantum information processing task. Assisted with linear optical elements, we experimentally demonstrate perfect discrimination between single-bit unitary operations using two…
In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to…
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of…
In this article we discuss the presentation of a random binary matrix using sequence of whole nonnegative numbers. We examine some advantages and disadvantages of this presentation as an alternative of the standard presentation using…
Nonlinear optical cavities are crucial both in classical and quantum optics; in particular, nowadays optical parametric oscillators are one of the most versatile and tunable sources of coherent light, as well as the sources of the highest…
Nuclear magnetic resonance techniques are used to realize a quantum algorithm experimentally. The algorithm allows a simple NMR quantum computer to determine global properties of an unknown function requiring fewer function ``calls'' than…