相关论文: Quantum statistical mechanics of encryption: reach…
We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our…
Out-of-time-ordered correlators (OTOC) are a quantifier of quantum information scrambling and quantum chaos. We propose an efficient quantum algorithm to measure OTOCs that provides an exponential speed-up over the best known classical…
The standard definition of quantum state randomization, which is the quantum analog of the classical one-time pad, consists in applying some transformation to the quantum message conditioned on a classical secret key $k$. We investigate…
An important part of the information theory folklore had been about the output statistics of codes that achieve the capacity and how the empirical distributions compare to the output distributions induced by the optimal input in the channel…
We provide bounds on the efficiency of secure one-sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results we derive bounds on the efficiency of…
Efficient entanglement distribution is the foundational challenge in realizing large-scale Quantum Networks. However, state-of-the-art solutions are frequently limited by restrictive operational assumptions, prohibitive computational…
We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a…
An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$. We describe a classical algorithm with quasipolynomial runtime $n^{O(\log{n})}$ that…
Out-of-time-order correlators (OTOCs) have been proposed as a probe of chaos in quantum mechanics, on the basis of their short-time exponential growth found in some particular set-ups. However, it has been seen that this behavior is not…
Achieving reliable performance on early fault-tolerant quantum hardware will depend on protocols that manage noise without incurring prohibitive overhead. We propose a novel framework that integrates quantum computation with the…
Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…
Block-encoding is a critical subroutine in quantum computing, enabling the transformation of classical data into a matrix representation within a quantum circuit. The resource trade-offs in simulating a block-encoding can be quantified by…
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This…
We investigate optimal encoding and retrieval of digital data, when the storage/communication medium is described by quantum mechanics. We assume an m-ary alphabet with arbitrary prior distribution, and an n-dimensional quantum system.…
Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…
Classical data encoding is usually treated as a black-box in the oracle-based quantum algorithms. On the other hand, their constructions are crucial for practical algorithm implementations. Here, we open the black-boxes of data encoding and…
We introduce a new type of cryptographic primitive that we call hiding fingerprinting. A (quantum) fingerprinting scheme translates a binary string of length $n$ to $d$ (qu)bits, typically $d\ll n$, such that given any string $y$ and a…
Quantum state preparation, also known as encoding or embedding, is a crucial initial step in many quantum algorithms and often constrains theoretical quantum speedup in fields such as quantum machine learning and linear equation solvers.…
Recent years have seen rapid development in the subject of quantum coding theory, with breakthroughs on many exciting classes of codes, including quantum LDPC codes, quantum locally testable codes, and quantum codes with interesting…