Related papers: Nonlocal Magic Generation and Information Scrambli…
Analog error correction codes, by relaxing the source space and the codeword space from discrete fields to continuous fields, present a generalization of digital codes. While linear codes are sufficient for digital codes, they are not for…
Given a quantum many-body system with few-body interactions, how rapidly can quantum information be hidden during time evolution? The fast scrambling conjecture is that the time to thoroughly mix information among N degrees of freedom grows…
While quantum computing can accomplish tasks that are classically intractable, the presence of noise may destroy this advantage in the absence of fault tolerance. In this work, we present a classical algorithm that runs in…
Information scrambling refers to the propagation of information throughout a quantum system. Its study not only contributes to our understanding of thermalization but also has wide implications in quantum information and black hole physics.…
Recent work by Bravyi et al. constructs a relation problem that a noisy constant-depth quantum circuit (QNC$^0$) can solve with near certainty (probability $1 - o(1)$), but that any bounded fan-in constant-depth classical circuit (NC$^0$)…
The propagation of an external transverse magnetic signal acting locally on a 1d chain of spins generates a disturbance which runs through the system. This quantum effect can be interpreted as a classical traveling wave which contains a…
It has recently been discovered that random quantum circuits provide an avenue to realize rich entanglement phase diagrams, which are hidden to standard expectation values of operators. Here we study (2+1)D random circuits with random…
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a…
We study information scrambling -- a spread of initially localized quantum information into the system's many degree of freedom -- in discrete-time quantum walks. We consider out-of-time-ordered correlators (OTOC) and K-complexity as a…
The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However,…
Simulating quantum circuits classically is an important area of research in quantum information, with applications in computational complexity and validation of quantum devices. One of the state-of-the-art simulators, that of Bravyi et al,…
We consider the Brownian SYK model of $N$ interacting Majorana fermions, with random couplings that are taken to vary independently at each time. We study the out-of-time-ordered correlators (OTOCs) of arbitrary observables and 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…
When the local dimension $d$ is an odd prime, the qudit Clifford group is only a 2-design, but not a 3-design, unlike the qubit counterpart. This distinction and its extension to Clifford orbits have profound implications for many…
The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the…
We compute the scrambling rate at the antiferromagnetic (AFM) quantum critical point, using the fixed point theory of Phys. Rev. X $\boldsymbol{7}$, 021010 (2017). At this strongly coupled fixed point, there is an emergent control parameter…
In a fast scrambling many-body quantum system, information is spread and entanglement is built up on a timescale that grows logarithmically with the system size. This is of fundamental interest in understanding the dynamics of many-body…
Achieving near-term quantum advantage will require accurate estimation of quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum…
We study the formation of short-depth designs beyond the unitary group. We provide a range of results on several groups of broad interest in quantum information science: the Clifford group, the orthogonal group, the unitary symplectic…
Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near-term. In this…