相关论文: Random access codes via quantum contextual redunda…

Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…

We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective…

Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…

Measurement-based quantum computing relies on the generation of large entangled cluster states that act as a universal resource on which logical circuits can be imprinted and executed through local measurements. A number of strategies for…

We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems. To this end, we derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems. We…

The goal of the paper is to check whether the real eigenstates of the observables in the single qudit Pauli group may lead to quantum contextuality, the property that mutually compatible and independent experiments depend on each other. We…

The stable operation of quantum computers will rely on error-correction, in which single quantum bits of information are stored redundantly in the Hilbert space of a larger system. Such encoded qubits are commonly based on arrays of many…

Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all known algorithms at constant rate require exponential time.…

Quantum information processing shows advantages in many tasks, including quantum communication and computation, comparing to its classical counterpart. The essence of quantum processing lies on the fundamental difference between classical…

The output randomness from a random number generator can be certified by observing the violation of quantum contextuality inequalities based on the Kochen-Specker theorem. Contextuality can be tested in a single quantum system, which…

The sequential quantum random access code (QRAC) allows two or more decoders to obtain a desired message with higher success probability than the best classical bounds by appropriately modulating the measurement sharpness. Here, we propose…

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.…

Contextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, $\hbar$, can also be used to…

We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…

We introduce the problem of unsupervised classification of quantum data, namely, of systems whose quantum states are unknown. We derive the optimal single-shot protocol for the binary case, where the states in a disordered input array are…

Fault-tolerant quantum computing will require accurate estimates of the resource overhead, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors of logical performance. We present a scalable…

A classical random variable can be faithfully compressed into a sequence of bits with its expected length lies within one bit of Shannon entropy. We generalize this variable-length and faithful scenario to the general quantum source…

We present a new quantum communication complexity protocol, the promise--Quantum Random Access Code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational…

We give trade-offs between classical communication, quantum communication, and entanglement for processing information in the Shannon-theoretic setting. We first prove a unit-resource capacity theorem that applies to the scenario where only…

Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished.…