Related papers: Pseudorandom and Pseudoentangled States from Subse…

Entanglement allows for the nonlocality of quantum theory, which is the resource behind device-independent quantum information protocols. However, not all entangled quantum states display nonlocality, and a central question is to determine…

We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/eps^{O(d)} fooling degree d PTFs with error at most eps. Previously, no…

$k$-Uniform states are fundamental to quantum information and computing, with applications in multipartite entanglement and quantum error-correcting codes (QECCs). Prior work has primarily focused on constructing exact $k$-uniform states or…

We propose a new cryptographic protocol. It is suggested to encode information in ordinary binary form into many-qubit entangled states with the help of a quantum computer. A state of qubits (realized, e.g., with photons) is transmitted…

Pseudo-Random Numbers Generators (PRNGs) are algorithms produced to generate long sequences of statistically uncorrelated numbers, i.e. Pseudo-Random Numbers (PRNs). These numbers are widely employed in mid-level cryptography and in…

I explore the possibility that a quantum system S may be described completely by the combination of its standard quantum state $|\psi\rangle$ and a (hidden) quantum state $|\phi\rangle$ (that lives in the same Hilbert space), such that the…

A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all…

The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…

Building upon the results of [R. Augusiak et al., Phys. Rev. Lett. 115, 030404 (2015)] we develop a general approach to the generation of genuinely entangled multipartite states of any number of parties from genuinely entangled states of a…

In this work, we construct small sets of bipartite orthogonal pure states that cannot be perfectly distinguished by local operations and classical communication (LOCC). We mention that not all the states within the constructed sets are…

Pseudorandom unitaries (PRUs) are ensembles of efficiently implementable unitary operators that cannot be distinguished from Haar random unitaries by any quantum polynomial-time algorithm with query access to the unitary. We present a…

High quality random numbers are necessary in the modern world. Ranging from encryption keys in cyber security to models and simulations for scientific use: it's important that these random numbers are of high quality and quickly attainable.…

Quantum cryptographic definitions are often sensitive to the number of copies of the cryptographic states revealed to an adversary. Making definitional changes to the number of copies accessible to an adversary can drastically affect…

We study a generalization of entanglement testing which we call the "hidden cut problem." Taking as input copies of an $n$-qubit pure state which is product across an unknown bipartition, the goal is to learn precisely where the state is…

The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of…

We analytically derive the bit-string probability distributions of subsystems of random pure states and depolarized random states using the Dirichlet distribution. We identify the exact Beta distribution as the universal statistical law of…

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…

Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in Von Neumann entropy to…

Randomization of quantum states is the quantum analogue of the classical one-time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/epsilon^2) Pauli operators to map any d-dimensional…

We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission…