Related papers: Distribution of interference in random quantum alg…
We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…
Quantum computers with hundreds of qubits will be available soon. Unfortunately, high device error-rates pose a significant challenge in using these near-term quantum systems to power real-world applications. Executing a program on existing…
Quantum emitters such as quantum dots, defects in diamond or in silicon have emerged as efficient single photon sources that are progressively exploited in quantum technologies. In 2019, it was shown that the emitted single photon states…
We consider deterministic and {\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\in\{H_1,...,H_m\}$, $H=\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$.…
The possible effect of environment on the efficiency of a quantum algorithm is considered explicitely. It is illustrated through the example of Shor's prime factorization algorithm that this effect may be disastrous. The influence of…
This paper studies projections of uniform random elements of (co)adjoint orbits of compact Lie groups. Such projections generalize several widely studied ensembles in random matrix theory, including the randomized Horn's problem, the…
We describe a scalable experimental protocol for obtaining estimates of the error rate of individual quantum computational gates. This protocol, in which random Clifford gates are interleaved between a gate of interest, provides a bounded…
Hybrid quantum algorithms combine the strengths of quantum and classical computing. Many quantum algorithms, such as the variational quantum eigensolver (VQE), leverage this synergy. However, quantum circuits are executed in full, even when…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles (circular unitary, orthogonal, and symplectic ensembles; CUE, COE and CSE). We utilise the established model of a…
As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide…
Random many-body states are both a useful tool to model certain physical systems and an important asset for quantum computation. Realising them, however, generally requires an exponential (in system size) amount of resources. Recent…
We show that the most important measures of quantum chaos like frame potentials, scrambling, Loschmidt echo, and out-of-time-order correlators (OTOCs) can be described by the unified framework of the isospectral twirling, namely the Haar…
The projected ensemble is based on the study of the quantum state of a subsystem $A$ conditioned on projective measurements in its complement. Recent studies have observed that a more refined measure of the thermalization of a chaotic…
Near-term quantum computers have been built as intermediate-scale quantum devices and are fragile against quantum noise effects, namely, NISQ devices. Traditional quantum-error-correcting codes are not implemented on such devices and to…
We demonstrate quantum algorithms to implement pseudo-random operators that closely reproduce statistical properties of random matrices from the three universal classes: unitary, symmetric, and symplectic. Modified versions of the…
We consider the hardness of computing additive approximations to output probabilities of random quantum circuits. We consider three random circuit families, namely, Haar random, $p=1$ QAOA, and random IQP circuits. Our results are as…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where superpositions of…
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our…