Related papers: Distribution of interference in random quantum alg…
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…
What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. Expanding the circuits in a…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…
With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of 99.95% with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between…
The random matrix ensembles (RMT) of quantum statistical Hamiltonian operators, e.g.Gaussian random matrix ensembles (GRME) and Ginibre random matrix ensembles (Ginibre RME), are applied to following quantum statistical systems: nuclear…
An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the systematic errors in gates and…
The last few years have seen rapid development of applications of quantum computation to quantum field theory. The first algorithms for quantum simulation of scattering have been proposed in the context of scalar and fermionic theories,…
In this paper we present an architecture that enables the redesign of large-scale quantum circuits on quantum hardware based on the entangling quantum generative adversarial network (EQ-GAN). Specifically, by prepending a random quantum…
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step…
We consider a generalized model of repeated quantum interactions, where a system $\mathcal{H}$ is interacting in a random way with a sequence of independent quantum systems $\mathcal{K}_n, n \geq 1$. Two types of randomness are studied in…
We apply concepts of random differential geometry connected to the random matrix ensembles of the random linear operators acting on finite dimensional Hilbert spaces. The values taken by random linear operators belong to the Liouville…
The random matrix ensembles are applied to the quantum statistical two-dimensional systems of electrons. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The…
Random matrix theory is used to represent generic loss of coherence of a fixed central system coupled to a quantum-chaotic environment, represented by a random matrix ensemble, via random interactions. We study the average density matrix…
We introduce a single-number metric, quantum volume, that can be measured using a concrete protocol on near-term quantum computers of modest size ($n\lesssim 50$), and measure it on several state-of-the-art transmon devices, finding values…
An active area of investigation in the search for quantum advantage is Quantum Machine Learning. Quantum Machine Learning, and Parameterized Quantum Circuits in a hybrid quantum-classical setup in particular, could bring advancements in…
Exploring quantum applications of near-term quantum devices is a rapidly growing field of quantum information science with both theoretical and practical interests. A leading paradigm to establish such near-term quantum applications is…
A generalisation of the Ginibre ensemble of non-Hermitian random square matrices is introduced. The corresponding probability measure is induced by the ensemble of rectangular Gaussian matrices via a quadratisation procedure. We derive the…
Incoherence in the controlled Hamiltonian is an important limitation on the precision of coherent control in quantum information processing. Incoherence can typically be modelled as a distribution of unitary processes arising from slowly…
Sampling from the output distribution of chaotic quantum evolutions, and of pseudo-random universal quantum circuits in particular, has been proposed as a prominent milestone for near-term quantum supremacy. The same paper notes that…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…