Related papers: (Pseudo) Random Quantum States with Binary Phase
In this paper, we introduce a new conception of pseudorandom phase ensemble to simulate a quantum ensemble. A pseudorandom sequence is inseparability and integral that are demonstrated only for a whole sequence not for a single phase unit,…
We propose and experimentally demonstrate a new method to generate arbitrary Fock-state superpositions in a superconducting quantum circuit, where a qubit is dispersively coupled to a microwave cavity mode without the need of fine-frequency…
We characterize the expressive power of quantum circuits with the pseudo-dimension, a measure of complexity for probabilistic concept classes. We prove pseudo-dimension bounds on the output probability distributions of quantum circuits; the…
It is well-known that digital signatures can be constructed from one-way functions in a black-box way. While one-way functions are essentially the minimal assumption in classical cryptography, this is not the case in the quantum setting. A…
For the complete estimation of arbitrary unknown quantum states by measurements, the use of mutually unbiased bases has been well-established in theory and experiment for the past 20 years. However, most constructions of these bases make…
As they can travel long distances, free space optical quantum states are good candidates for carrying information in quantum information technology protocols. These states, however, are often complex to produce and require protocols whose…
Dynamical systems generated by iterations of multivariate polynomials with slow degree growth have proved to admit good estimates of exponential sums along their orbits which in turn lead to rather stronger bounds on the discrepancy for…
The study of generic properties of quantum states has led to an abundance of insightful results. A meaningful set of states that can be efficiently prepared in experiments are ground states of gapped local Hamiltonians, which are well…
A fundamental question is understanding the rate at which random quantum circuits converge to the Haar measure. One quantity which is important in establishing this rate is the spectral gap of a random quantum ensemble. In this work we…
Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple…
Quantum tunneling across double potential barriers is studied. With the assumption that the real space is a continuum, it is rigorously proved that large barriers of arbitrary shapes can be penetrated by low-energy particles with a…
Random unitaries are useful in quantum information and related fields, but hard to generate with limited resources. An approximate unitary $k$-design is an ensemble of unitaries with an underlying measure over which the average is close to…
The unitary design formation in random circuits has attracted considerable attention due to its wide range of practical applications and relevance to fundamental physics. While the formation rates in Haar random circuits have been…
The efficiency of locally generating unitary designs, which capture statistical notions of quantum pseudorandomness, lies at the heart of wide-ranging areas in physics and quantum information technologies. While there are extensive potent…
In this work, we study distributions of unitaries generated by random quantum circuits containing only symmetry-respecting gates. We develop a unified approach applicable to all symmetry groups and obtain an equation that determines the…
We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $\log n$ depth. In a similar manner, we construct pseudorandom unitaries (PRUs) in 1D circuits in…
Previous theoretical works showed that all pure two-qubit entangled states can generate one bit of local randomness and can be self-tested through the violation of proper Bell inequalities. We report an experiment in which nearly pure…
We present a new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary polynomial-sized quantum circuits. Building on the framework of Broadbent and Jeffery and recent results in the…
We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to…
We propose and demonstrate a technique for quantum random number generation based on the random population of the output spatial modes of a beam splitter when both inputs are simultaneously fed with indistinguishable weak coherent states.…