Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)

Experimental demonstration of quantum data compression

Lee A. Rozema, Dylan H. Mahler, Alex Hayat, Peter S. Turner, Aephraim M. Steinberg

Published May 1, 2013• 0 citations
Publisher

Abstract

We present experimental results implementing the Quantum Schur-Weyl Transform QSWT for three qubits, allowing us to compress three quantum bits into two. In our implementation the three qubits are encoded in two photons. The first photon encodes a path and a polarization qubit, while the second photon encodes a single polarization qubit. We use the QSWT to map all of the information from the 3 qubits onto the path and polarization qubits encoded in the first photon, allowing us to discard the second photon. We characterize our compression by performing measurements on the remaining two qubits and show that they obey the statistics of a three qubit system. We expect our technique to become extremely useful in the near future, for all quantum information architectures, as few qubit quantum memories become available.

DOI
10.1109/cleoe-iqec.2013.6801700

Related papers

Quantum Data Compression of a Qubit Ensemble

Lee A. Rozema, Dylan H. Mahler, Alex Hayat +2 more

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 extreme difficulty involved in creating reliable quantum memories. We present a protocol in which an ensemble of quantum bits (qubits) can in principle be perfectly compressed into exponentially fewer qubits. We then experimentally implement our algorithm, compressing three photonic qubits into two. This protocol sheds light on the subtle differences between quantum and classical information. Furthermore, since data compression stores all of the available information about the quantum state in fewer physical qubits, it could allow for a vast reduction in the amount of quantum memory required to store a quantum ensemble, making even today's limited quantum memories far more powerful than previously recognized.

arXiv:1410.3941•Physical Review Letters•Oct 17, 2014•58 citations

Experimental Demonstration of Quantum Source Coding

Yasuyoshi Mitsumori, John A. Vaccaro, Stephen Mark Barnett +4 more

We report an experimental demonstration of Schumacher's quantum noiseless coding theorem. Our experiment employs a sequence of single photons, each of which represents three qubits in terms of eight spatial and polarization modes. We initially prepare each photon in one of a set of eight nonorthogonal code word states corresponding to the value of a block of three binary letters. We use quantum coding to compress this quantum data into a two-qubit quantum channel and then uncompress the two-qubit channel to restore the original data with a fidelity approaching the theoretical limit.

arXiv:quant-ph/0304036•Physical Review Letters•Nov 19, 2003•15 citations

Compressing Quantum Fisher Information

Rui Jie Tang, Jeremy Guenza Marcus, Noah Lupu-Gladstein +5 more

We show that the quantum Fisher information about any phase parameter encoded in a family of pure quantum states can be faithfully compressed into a single qubit, accompanied by a logarithmic amount of classical bits. When the phase is encoded into many identical copies of a qubit state on the equator of the Bloch sphere, we show that the compression can be implemented sequentially, by iteratively compressing pairs of qubits into a single qubit. We experimentally demonstrate this building block in a photonic setup, developing two alternative compression strategies, based on Type-I fusion gate and a postselected implementation of the CNOT gate.

quant-pharXiv:2602.09358•Feb 11, 2026•0 citations

Efficient multi‐qubit quantum data compression

Chen‐Rui Fan, Bo Lü, Xue‐Ting Feng +2 more

Quantum data compression is of great significance to both quantum computation and quantum communication due to the limited resources for quantum storage. Here in this study, we present an efficient multi-qubit quantum data compression protocol in which N identically prepared qubits can be perfectly compressed into qubits. Moreover, the feasible implementation of the quantum data compression is also designed based on the IBM Quantum Experience. The experiment reveals efficient information compression performance using the current scheme. We believe this method might be useful in quantum information which one could make the encoding of information on the qubits more efficiently, and also reducing the resources consumption for quantum storage.

Quantum Engineering•May 5, 2021•15 citations

Manipulating Biphotonic Qutrits

B. P. Lanyon, Till J. Weinhold, Nathan K. Langford +4 more

Quantum information carriers with higher dimension than the canonical qubit offer significant advantages. However, manipulating such systems is extremely difficult. We show how measurement-induced nonlinearities can dramatically extend the range of possible transforms on biphotonic qutrits-three-level quantum systems formed by the polarization of two photons in the same spatiotemporal mode. We fully characterize the biphoton-photon entanglement that underpins our technique, thereby realizing the first instance of qubit-qutrit entanglement. We discuss an extension of our technique to generate qutrit-qutrit entanglement and to manipulate any bosonic encoding of quantum information.

arXiv:0707.2880•Physical Review Letters•Feb 14, 2008•182 citations

Photonic implementation of quantum hidden subgroup database compression

Qianyi Wang, Feiyang Liu, Teng Hu +6 more

We experimentally demonstrate quantum data compression exploiting hidden subgroup symmetries using a photonic quantum processor. Classical databases containing generalized periodicities-symmetries that are in the worst cases inefficient for known classical algorithms to be detect-can efficiently compressed by quantum hidden subgroup algorithms. We implement a variational quantum autoencoder that autonomously learns both the symmetry type (e.g., $\mathbb{Z}_2 \times \mathbb{Z}_2$ vs. $\mathbb{Z}_4$) and the generalized period from structured data. The system uses single photons encoded in path, polarization, and time-bin degrees of freedom, with electronically controlled waveplates enabling tunable quantum gates. Training via gradient descent successfully identifies the hidden symmetry structure, achieving compression by eliminating redundant database entries. We demonstrate two circuit ansatzes: a parametrized generalized Fourier transform and a less-restricted architecture for Simon's symmetry. Both converge successfully, with the cost function approaching zero as training proceeds. These results provide experimental proof-of-principle that photonic quantum computers can compress classical databases by learning symmetries inaccessible to known efficient classical methods, opening pathways for quantum-enhanced information processing.

quant-pharXiv:2511.02527•Nov 5, 2025•0 citations
We present experimental results implementing the Quantum Schur-Weyl Transform QSWT for three qubits, allowing us to compress three quantum bits into two. In our implementation the three qubits are encoded in two photons. The first photon encodes a path and a polarization qubit, while the second photon encodes a single polarization qubit. We use the QSWT to map all of the information from the 3 qubits onto the path and polarization qubits encoded in the first photon, allowing us to discard the second photon. We characterize our compression by performing measurements on the remaining two qubits and show that they obey the statistics of a three qubit system. We expect our technique to become extremely useful in the near future, for all quantum information architectures, as few qubit quantum memories become available.
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 extreme difficulty involved in creating reliable quantum memories. We present a protocol in which an ensemble of quantum bits (qubits) can in principle be perfectly compressed into exponentially fewer qubits. We then experimentally implement our algorithm, compressing three photonic qubits into two. This protocol sheds light on the subtle differences between quantum and classical information. Furthermore, since data compression stores all of the available information about the quantum state in fewer physical qubits, it could allow for a vast reduction in the amount of quantum memory required to store a quantum ensemble, making even today's limited quantum memories far more powerful than previously recognized.
We report an experimental demonstration of Schumacher's quantum noiseless coding theorem. Our experiment employs a sequence of single photons, each of which represents three qubits in terms of eight spatial and polarization modes. We initially prepare each photon in one of a set of eight nonorthogonal code word states corresponding to the value of a block of three binary letters. We use quantum coding to compress this quantum data into a two-qubit quantum channel and then uncompress the two-qubit channel to restore the original data with a fidelity approaching the theoretical limit.
We show that the quantum Fisher information about any phase parameter encoded in a family of pure quantum states can be faithfully compressed into a single qubit, accompanied by a logarithmic amount of classical bits. When the phase is encoded into many identical copies of a qubit state on the equator of the Bloch sphere, we show that the compression can be implemented sequentially, by iteratively compressing pairs of qubits into a single qubit. We experimentally demonstrate this building block in a photonic setup, developing two alternative compression strategies, based on Type-I fusion gate and a postselected implementation of the CNOT gate.
Quantum data compression is of great significance to both quantum computation and quantum communication due to the limited resources for quantum storage. Here in this study, we present an efficient multi-qubit quantum data compression protocol in which N identically prepared qubits can be perfectly compressed into qubits. Moreover, the feasible implementation of the quantum data compression is also designed based on the IBM Quantum Experience. The experiment reveals efficient information compression performance using the current scheme. We believe this method might be useful in quantum information which one could make the encoding of information on the qubits more efficiently, and also reducing the resources consumption for quantum storage.
Quantum information carriers with higher dimension than the canonical qubit offer significant advantages. However, manipulating such systems is extremely difficult. We show how measurement-induced nonlinearities can dramatically extend the range of possible transforms on biphotonic qutrits-three-level quantum systems formed by the polarization of two photons in the same spatiotemporal mode. We fully characterize the biphoton-photon entanglement that underpins our technique, thereby realizing the first instance of qubit-qutrit entanglement. We discuss an extension of our technique to generate qutrit-qutrit entanglement and to manipulate any bosonic encoding of quantum information.
We experimentally demonstrate quantum data compression exploiting hidden subgroup symmetries using a photonic quantum processor. Classical databases containing generalized periodicities-symmetries that are in the worst cases inefficient for known classical algorithms to be detect-can efficiently compressed by quantum hidden subgroup algorithms. We implement a variational quantum autoencoder that autonomously learns both the symmetry type (e.g., Z2×Z2\mathbb{Z}_2 \times \mathbb{Z}_2Z2​×Z2​ vs. Z4\mathbb{Z}_4Z4​) and the generalized period from structured data. The system uses single photons encoded in path, polarization, and time-bin degrees of freedom, with electronically controlled waveplates enabling tunable quantum gates. Training via gradient descent successfully identifies the hidden symmetry structure, achieving compression by eliminating redundant database entries. We demonstrate two circuit ansatzes: a parametrized generalized Fourier transform and a less-restricted architecture for Simon's symmetry. Both converge successfully, with the cost function approaching zero as training proceeds. These results provide experimental proof-of-principle that photonic quantum computers can compress classical databases by learning symmetries inaccessible to known efficient classical methods, opening pathways for quantum-enhanced information processing.