Implementation of quantum compression on IBM quantum computers
arXiv:2201.10999 · doi:10.1038/s41598-022-09881-8
Abstract
Advances in development of quantum computing processors brought ample opportunities to test the performance of various quantum algorithms with practical implementations. In this paper we report on implementations of quantum compression algorithm that can efficiently compress unknown quantum information. We restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today's quantum processors. We implemented the algorithm on IBM quantum processors with two different topological layouts - a fully connected triangle processor and a partially connected line processor. It turns out that the incomplete connectivity of the line processor affects the performance only minimally. On the other hand, it turns out that the transpilation, i.e. compilation of the circuit into gates physically available to the quantum processor, crucially influences the result. We also have seen that the compression followed by immediate decompression is, even for such a simple case, on the edge or even beyond the capabilities of currently available quantum processors.
arXiv comment10 pages, 5 figures
References in corpus (31)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A variational eigenvalue solver on a quantum processor
- Quantum cryptography: Public key distribution and coin tossing
- Advances in Quantum Cryptography
- Noisy intermediate-scale quantum (NISQ) algorithms
- Theoretical efficient high capacity Quantum Key Distribution Scheme
- Quantum Chemistry in the Age of Quantum Computing
- Trapped-Ion Quantum Computing: Progress and Challenges
- Realization of a scalable Shor algorithm
- Grover Algorithm with zero theoretical failure rate
- Superconducting Quantum Computing: A Review
- Complete 3-Qubit Grover Search on a Programmable Quantum Computer
- Performing Quantum Computing Experiments in the Cloud
- Experimental test of Mermin inequalities on a 5-qubit quantum computer
- Quantum phase space measurement and entanglement validation made easy
- Experimental Implementation of Quantum Walks on IBM Quantum Computers
- Quantum Data Compression of a Qubit Ensemble
- Leggett-Garg test of superconducting qubit addressing the clumsiness loophole
- Realization of a quantum autoencoder for lossless compression of quantum data
- Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
- Quantum Walks
- Efficient compression of quantum information
- Experimental NMR Realization of A Generalized Quantum Search Algorithm
- Implementation of efficient quantum search algorithms on NISQ computers
- Compressed quantum computation using the IBM Quantum Experience
- Demonstration of entanglement assisted invariance on IBM's Quantum Experience
- Demonstrating non-Abelian braiding of surface code defects in a five qubit experiment
- Optimal compression for identically prepared qubit states
- Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
- Every entangled state provides an advantage in classical communication
- Quantum Compression of Tensor Network States