English
Related papers

Related papers: Efficient Quantum Compression for Ensembles of Ide…

200 papers

We propose a scheme for an exact efficient transformation of a tensor product state of many identically prepared qubits into a state of a logarithmically small number of qubits. Using a quadratic number of elementary quantum gates we…

Quantum Physics · Physics 2010-03-31 Martin Plesch , Vladimir Buzek

Data compression is a ubiquitous aspect of modern information technology, and the advent of quantum information raises the question of what types of compression are feasible for quantum data, where it is especially relevant given the…

Quantum Physics · Physics 2014-12-17 Lee A. Rozema , Dylan H. Mahler , Alex Hayat , Peter S. Turner , Aephraim M. Steinberg

Two-Ievel (qubit) clock systems are often used to perform precise measurement of time. In this work, we propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into…

Quantum Physics · Physics 2022-09-15 Yuxiang Yang , Giulio Chiribella , Masahito Hayashi

We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of…

We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a…

Quantum Physics · Physics 2007-05-23 Anura Abeyesinghe , Patrick Hayden , Graeme Smith , Andreas Winter

Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically…

We revisit the task of visible compression of an ensemble of quantum states with entanglement assistance in the one-shot setting. The protocols achieving the best compression use many more qubits of shared entanglement than the number of…

Quantum Physics · Physics 2020-07-06 Shima Bab Hadiashar , Ashwin Nayak

We consider the most general (finite-dimensional) quantum mechanical information source, which is given by a quantum system $A$ that is correlated with a reference system $R$. The task is to compress $A$ in such a way as to reproduce the…

Quantum Physics · Physics 2024-09-26 Zahra Baghali Khanian , Andreas Winter

In this paper, we present an efficient quantum compression method for identically prepared states with arbitrary dimentional.

Quantum Physics · Physics 2023-07-25 Zeyu Chen , Chunhe Xiong , Kamil Khadiev , Junde Wu

We provide a rate distortion interpretation of the problem of quantum data compression of ensembles of mixed states with commuting density operators. There are two versions of this problem. In the visible case the sequence of states is…

Quantum Physics · Physics 2007-05-23 Gerhard Kramer , Serap A. Savari

We design quantum compression algorithms for parametric families of tensor network states. We first establish an upper bound on the amount of memory needed to store an arbitrary state from a given state family. The bound is determined by…

Quantum Physics · Physics 2021-09-28 Ge Bai , Yuxiang Yang , Giulio Chiribella

We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo's information quantity and are attained through use of the optimal universal cloning machine, which finds…

Quantum Physics · Physics 2016-12-02 Yuxiang Yang , Giulio Chiribella , Masahito Hayashi

Shallow quantum circuits feature not only computational advantages over their classical counterparts but also cutting-edge applications. Storing quantum information generated by shallow circuits is a fundamental question of both theoretical…

Quantum Physics · Physics 2025-01-14 Yuxiang Yang

We present a formula that determines the optimal number of qubits per message that allows asymptotically faithful compression of the quantum information carried by an ensemble of mixed states. The set of mixed states determines a…

Quantum Physics · Physics 2009-11-07 Masato Koashi , Nobuyuki Imoto

We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning…

Quantum Physics · Physics 2022-02-07 Sahel Ashhab

Image-based data is a popular arena for testing quantum machine learning algorithms. A crucial factor in realizing quantum advantage for these applications is the ability to efficiently represent images as quantum states. Here we present a…

Quantum Physics · Physics 2023-10-10 Jason Iaconis , Sonika Johri

Collective decoherence is possible if the departure between quantum bits is smaller than the effective wave length of the noise field. Collectivity in the decoherence helps us to devise more efficient quantum codes. We present a class of…

Quantum Physics · Physics 2009-10-31 Lu-Ming Duan , Guang-Can Guo

In the realm of quantum information processing, the efficient characterization of entangled states poses an overwhelming challenge, rendering the traditional methods including quantum tomography unfeasible and impractical. To tackle this…

Quantum Physics · Physics 2025-12-09 Ye-Chao Liu , Jiangwei Shang

It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. This property ensures the security of quantum key distribution. It is therefore an important task in quantum communication to design and…

Quantum Physics · Physics 2023-11-27 Lorcan O. Conlon , Falk Eilenberger , Ping Koy Lam , Syed M. Assad

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…

Quantum Physics · Physics 2016-09-08 K. V. Bayandin , G. B. Lesovik
‹ Prev 1 2 3 10 Next ›