相关论文: A quantum analog of Huffman coding

We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances…

We present a dense coding scheme between one sender and two receivers, which guarantees that the receivers simultaneously obtain their respective messages. In our scheme, the quantum entanglement channel is first locked by the sender so…

Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information…

We give a polynomial-time approximation scheme for the generalization of Huffman Coding in which codeword letters have non-uniform costs (as in Morse code, where the dash is twice as long as the dot). The algorithm computes a…

We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…

This paper initiates the study of quantum computing within the constraints of using a polylogarithmic ($O(\log^k n), k\geq 1$) number of qubits and a polylogarithmic number of computation steps. The current research in the literature has…

Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…

The quantum error correction theory is as a rule formulated in a rather convoluted way, in comparison to classical algebraic theory. This work revisits the error correction in a noisy quantum channel so as to make it intelligible to…

We study uncloneable quantum encryption schemes for classical messages as recently proposed by Broadbent and Lord. We focus on the information-theoretic setting and give several limitations on the structure and security of these schemes:…

Geometric phase is an indispensable element for achieving robust and high-fidelity quantum gates due to its built-in noise-resilience feature. However, due to the complexity of manipulation and the intrinsic leakage of the encoded quantum…

Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing…

In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of…

Quantum computers have the potential to efficiently solve a system of nonlinear ordinary differential equations (ODEs), which play a crucial role in various industries and scientific fields. However, it remains unclear which system of…

Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman problem. Length-limited Huffman coding, useful for many…

Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…

Quantum fingerprints are useful quantum encodings introduced by Buhrman, Cleve, Watrous, and de Wolf (Physical Review Letters, Volume 87, Number 16, Article 167902, 2001; quant-ph/0102001) in obtaining an efficient quantum communication…

The circuit-level implementation of a quantum string-matching algorithm, which matches a search string (pattern) of length $M$ inside a longer text of length $N$, has already been demonstrated in the literature to outperform its classical…

Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…

Quantum data locking is a quantum communication primitive that allows the use of a short secret key to encrypt a much longer message. It guarantees information-theoretical security against an adversary with limited quantum memory. Here we…

Practical applicability of quantum optimisation on near term devices is constrained by limited qubit counts and hardware noise, which restricts the scalability of quantum optimisation algorithms for combinatorial problems. The simulation of…