Related papers: (Pseudo) Random Quantum States with Binary Phase
We show that no EPR-like bipartite entanglement can be distilled from a tripartite Haar random state $|\Psi\rangle_{ABC}$ by local unitaries or local operations when each subsystem $A$, $B$, or $C$ has fewer than half of the total qubits.…
We present a polynomial-time quantum algorithm making a single query (in superposition) to a classical oracle, such that for every state $|\psi\rangle$ there exists a choice of oracle that makes the algorithm construct an exponentially…
We study how useful random states are for quantum metrology, i.e., surpass the classical limits imposed on precision in the canonical phase estimation scenario. First, we prove that random pure states drawn from the Hilbert space of…
Intrinsic randomness is generated when a quantum state is measured in any basis in which it is not diagonal. In an adversarial scenario, we quantify this randomness by the probability that a correlated eavesdropper could correctly guess the…
Let $\ket{\0}$ and $\ket{\1}$ be two states that are promised to come from known subsets of orthogonal subspaces, but are otherwise unknown. Our paper probes the question of what can be achieved with respect to the basis…
We introduce the Romu family of pseudo-random number generators (PRNGs) which combines the nonlinear operation of rotation with the linear operations of multiplication and (optionally) addition. Compared to conventional linear-only PRNGs,…
We introduce a hybrid machine-learning algorithm for designing quantum optics experiments that produce specific quantum states. Our algorithm successfully found experimental schemes to produce all 5 states we asked it to, including…
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 polynomials in the matrix elements of the…
Unitary $t$-designs are the bread and butter of quantum information theory and beyond. An important issue in practice is that of efficiently constructing good approximations of such unitary $t$-designs. Building on results by Aubrun (Comm.…
In part I, the formalism for the description of open quantum systems (that are embedded into a common well-defined environment) by means of a non-Hermitian Hamilton operator $\ch$ is sketched. Eigenvalues and eigenfunctions are…
The principle of superposition is an intriguing feature of Quantum Mechanics, which is regularly exploited at various instances. A recent work [PRL \textbf{116}, 110403 (2016)] shows that the fundamentals of Quantum Mechanics restrict the…
We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions, i.e., multivariate functions over the ring of integers modulo $d$, and investigate some of their structural properties. We also point out…
The standard randomized benchmarking protocol requires access to often complex operations that are not always directly accessible. Compiler optimization does not always ensure equal sequence length of the directly accessible universal gates…
We demonstrate a quantum random number generator based on the random nature of the phase difference between two independent laser sources. The speed of random bit generation is determined by the photodetector bandwidth and the linewidth of…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…
In this work we demonstrate the use of adapted classical phase retrieval algorithms to perform control-free quantum phase estimation. We eliminate the costly controlled time evolution and Hadamard test commonly required to access the…
As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide…
While one-way functions (OWFs) serve as the minimal assumption for computational cryptography in the classical setting, in quantum cryptography, we have even weaker cryptographic assumptions such as pseudo-random states, and EFI pairs,…
Quantum state tomography, the ability to deduce the density matrix of a quantum system from measured data, is of fundamental importance for the verification of present and future quantum devices. It has been realized in systems with few…
While the no-cloning theorem forbids the perfect replication of quantum information, it is sometimes possible to produce large numbers of replicas with vanishingly small error. This phenomenon, known as quantum superreplication, can take…