Related papers: Quantum State Designs from Minimally Random Quantu…
Gaussian states hold a fundamental place in quantum mechanics, quantum information, and quantum computing. Many subfields, including quantum simulation of continuous-variable systems, quantum chemistry, and quantum machine learning, rely on…
We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$-qubit pure state $|\psi\rangle$, we give an efficient algorithm that distinguishes whether…
Impurities, defects, and other types of imperfections are ubiquitous in realistic quantum many-body systems and essentially unavoidable in solid state materials. Often, such random disorder is viewed purely negatively as it is believed to…
In recent years, quantum computing has evolved as an exciting frontier, with the development of numerous algorithms dedicated to constructing quantum circuits that adeptly represent quantum many-body states. However, this domain remains in…
In a recently demonstrated quantum-state tomography scheme [Phys. Rev. Lett. 124, 010405 (2020)], a random control field is locally applied to a multipartite system to reconstruct the full quantum state of the system through…
Random ensembles of pure states have proven to be extremely important in various aspects of quantum physics such as benchmarking the performance of quantum circuits, testing for quantum advantage, providing novel insights for many-body…
Quantum computational pseudorandomness has emerged as a fundamental notion that spans connections to complexity theory, cryptography and fundamental physics. However, all known constructions of efficient quantum-secure pseudorandom objects…
Variational quantum algorithms have been a promising candidate to utilize near-term quantum devices to solve real-world problems. The powerfulness of variational quantum algorithms is ultimately determined by the expressiveness of the…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
Distributed quantum computing represents at present one of the most promising approaches to scaling quantum processors. Current implementations typically partition circuits into multiple cores, each composed of several qubits, with…
Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum…
We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…
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…
Gate-model quantum computers can allow quantum computations in near-term implementations. The stabilization of an optimal quantum state of a quantum computer is a challenge, since it requires stable quantum evolutions via a precise…
Quantum state designs, by enabling an efficient sampling of random quantum states, play a quintessential role in devising and benchmarking various quantum protocols with broad applications ranging from circuit designs to black hole physics.…
We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure in the study of implementations of quantum…
Quantum many-body systems display an extraordinary degree of complexity, yet many of their features are universal: they depend not on microscopic details, but on a few fundamental physical aspects such as symmetries. A central challenge is…
Just how fast does the brickwork circuit form an approximate 2-design? Is there any difference between anticoncentration and being a 2-design? Does geometry matter? How deep a circuit will I need in practice? We tell you everything you…
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…