Efficient Quantum Pseudorandomness.

@article{Brando2016EfficientQP,
  title={Efficient Quantum Pseudorandomness.},
  author={Fernando G. S. L. Brand{\~a}o and Aram Wettroth Harrow and Michal Horodecki},
  journal={Physical review letters},
  year={2016},
  volume={116 17},
  pages={
          170502
        }
}
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns… 

Figures from this paper

Experimental Implementation of Efficient Quantum Pseudorandomness on a 12-Spin System.
TLDR
It is found that substantial quantum pseudorandomness has been achieved at the 12-qubit scale, which may open up a path to experimentally explore quantum randomness on forthcoming large-scale quantum processors.
Mixing and localization in random time-periodic quantum circuits of Clifford unitaries
How much do local and time-periodic dynamics resemble a random unitary? In the present work, we address this question by using the Clifford formalism from quantum computation. We analyze a Floquet
Entanglement, quantum randomness, and complexity beyond scrambling
TLDR
A strong separation result is proved the existence of (state) 2-designs such that the Rényi entanglement entropies of higher orders can be bounded away from the maximum, which leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom.
Exact Emergent Quantum State Designs from Quantum Chaotic Dynamics.
We present exact results on a novel kind of emergent random matrix universality that quantum many-body systems at infinite temperature can exhibit. Specifically, we consider an ensemble of pure
Quantum Pseudorandomness and Classical Complexity
TLDR
It is shown that some computational complexity assumption is needed to construct pseudorandom states, by proving that pseudorRandom states do not exist if BQP = PP, and implications for cryptography, complexity theory, and quantum tomography are discussed.
Closing Gaps of a Quantum Advantage with Short-Time Hamiltonian Dynamics.
TLDR
This work provides the strongest theoretical evidence to date that Hamiltonian quantum simulators are classically intractable, building upon recently developed techniques for random circuit sampling.
Unitary designs from statistical mechanics in random quantum circuits.
TLDR
It is argued that random circuits form approximate unitary $k$-designs in O(nk) depth and are thus essentially optimal in both £n and $k, and can be shown in the limit of large local dimension.
Linear growth of quantum circuit complexity
The complexity of quantum states has become a key quantity of interest across various subfields of physics, from quantum computing to the theory of black holes. The evolution of generic quantum
Time-periodic dynamics generates pseudo-random unitaries
How much does local and time-periodic dynamics resemble a random unitary? In the present work we address this question by using the Clifford formalism from quantum computation. We analyse a Floquet
Fastest Local Entanglement Scrambler, Multistage Thermalization, and a Non-Hermitian Phantom
We study random quantum circuits and their rate of producing bipartite entanglement, specifically with respect to the choice of 2-qubit gates and the order (protocol) in which these are applied. The
...
...

References

SHOWING 1-10 OF 45 REFERENCES
Pseudo-randonmess and Learning in Quantum Computation
TLDR
It is shown that for a natural model of a random quantum circuit, the distribution of random circuits quickly converges to a 2-design, and many large deviation bound results for Haar random unitaries carry over to k-designs for k = poly(n).
Randomizing Quantum States: Constructions and Applications
TLDR
It is shown that there exists a set of roughly d’log d unitary operators whose average effect on every input pure state is almost perfectly randomizing, as compared to the d2 operators required to randomize perfectly.
Exponential quantum speed-ups are generic
TLDR
It is shown that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect.
Local Random Quantum Circuits are Approximate Polynomial-Designs
We prove that local random quantum circuits acting on n qubits composed of O(t10n2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether
Convergence rates for arbitrary statistical moments of random quantum circuits.
We consider a class of random quantum circuits where at each step a gate from a universal set is applied to a random pair of qubits, and determine how quickly averages of arbitrary finite-degree
Pseudo-Random Unitary Operators for Quantum Information Processing
TLDR
This work uses a nuclear magnetic resonance quantum processor to realize pseudorandom unitary operators that reproduce the expected random distribution of matrix elements and enables the practical application of random unitary operator in quantum communication and information processing protocols.
Efficient algorithm for multiqudit twirling for ensemble quantum computation
TLDR
Evidence is presented that the unitaries in the algorithm can come from a very imperfect random source or can even be chosen deterministically from a set ofcyclically alternating matrices, which is used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed.
Local random quantum circuits are approximate polynomial-designs: numerical results
We numerically investigate the statement that local random quantum circuits acting on n qubits composed of polynomially many nearest-neighbor two-qubit gates form an approximate unitary
Efficient Generation of Generic Entanglement
We find that generic entanglement is physical, in the sense that it can be generated in polynomial time from two-qubit gates picked at random. We prove as the main result that such a process
The emergence of typical entanglement in two-party random processes
We investigate the entanglement within a system undergoing a random, local process. We find that there is initially a phase of very fast generation and spread of entanglement. At the end of this
...
...