Related papers: Distribution of interference in random quantum alg…
One of the key features of quantum mechanics is the interference of probability amplitudes. The reason for the appearance of interference is mathematically very simple. It is the linear structure of the Hilbert space which is used for the…
Given a preferred orthonormal basis $B$ in the Hilbert space of a quantum system we define a measure of the coherence generating power of a unitary operation with respect to $B$. This measure is the average coherence generated by the…
Quantum coherence profoundly alters classical thermodynamic expectations by modifying the structure and accessibility of probability distributions. Classically, transitions to lower-entropy states (local second-law violations) are…
Producing quantum states at random has become increasingly important in modern quantum science, with applications both theoretical and practical. In particular, ensembles of such randomly-distributed, but pure, quantum states underly our…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
Local random circuits scramble efficiently and accordingly have a range of applications in quantum information and quantum dynamics. With a global $U(1)$ charge however, the scrambling ability is reduced; for example, such random circuits…
We introduce in this paper embedded Gaussian unitary ensemble of random matrices, for $m$ fermions in $\Omega$ number of single particle orbits, generated by random two-body interactions that are SU(4) scalar, called EGUE(2)-SU(4). Here the…
One of the main challenges in building a quantum processor is to characterize the environmental noise. Noise characterization can be achieved by exploiting different techniques, such as randomization where several sequences of random…
We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…
The increasing scale of near-term quantum hardware motivates the need for efficient noise characterization methods, since qubit and gate level techniques cannot capture crosstalk and correlated noise in many qubit systems. While scalable…
How can we take inspiration from a typical quantum algorithm to design heuristics for machine learning? A common blueprint, used from Deutsch-Josza to Shor's algorithm, is to place labeled information in superposition via an oracle,…
As a hybrid of artificial intelligence and quantum computing, quantum neural networks (QNNs) have gained significant attention as a promising application on near-term, noisy intermediate-scale quantum (NISQ) devices. Conventional QNNs are…
Random Quantum States are presently of interest in the fields of quantum information theory and quantum chaos. Moreover, a detailed study of their properties can shed light on some foundational issues of the quantum statistical mechanics…
We investigate the effect of quantum interferences and Coulomb interaction on the counting statistics of electrons crossing a double quantum dot in a parallel geometry using a generating function technique based on a quantum master equation…
The randomized quantum marginal problem asks about the joint distribution of the partial traces ("marginals") of a uniform random Hermitian operator with fixed spectrum acting on a space of tensors. We introduce a new approach to this…
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…
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…
We establish connections between state tomography, pseudorandomness, quantum state synthesis, and circuit lower bounds. In particular, let $\mathfrak{C}$ be a family of non-uniform quantum circuits of polynomial size and suppose that there…
Noise is usually regarded as the main obstacle to achieving a scalable quantum advantage, but recent evidence in quantum reservoir computing [L. Domingo, F. Borondo, and G. G. Carlo. Taking advantage of noise in quantum reservoir computing,…