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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Efficient Data Encoding and Decoding for Quantum Computing

Naveed Mahmud, Mingyoung Jeng, Alvir Nobel, Manu Chaudhary, Ishraq Islam, David Levy, Esam El‐Araby

Published Sep 1, 2022• 8 citations
Publisher

Abstract

Noisy Intermediate-Scale Quantum (NISQ) devices face many critical challenges that limit their usefulness for practical applications. A primary challenge is classical-to-quantum (C2Q) data encoding, which requires specific circuits for quantum state initialization, particularly for I/O intensive applications. The required state initialization circuits are often complex, and violate decoherence constraints. Another critical challenge for quantum computers is quantum state readout or quantum-to-classical (Q2C) data decoding. The general approach for Q2C involves repeated sampling of the quantum circuit, which often incurs significant overhead in the overall execution time. In this paper, we propose time-efficient methods for C2Q data encoding and Q2C data decoding for quantum algorithms. Decoherence optimized circuits for C2Q data encoding are presented along with analysis of their circuit depths. For Q2C, a novel approach based on more efficient sampling of the output state using the Quantum Wavelet Transform is proposed. The proposed methods are experimentally evaluated on a state-of-the-art quantum computing device from IBM Quantum using realistic multi-spectral data. Experimental results are consistent with our theoretical expectations and confirm the efficiency of our proposed methods compared to existing techniques. More specifically, our proposed C2Q method demonstrates a theoretical 2x reduction in circuit depth which resulted in improving the experimental execution time compared to the state-of-the-art, while our Q2C method achieved a maximum of 89% reduction in circuit sampling time.

DOI
10.1109/qce53715.2022.00110

Related papers

Improving quantum-to-classical data decoding using optimized quantum wavelet transform

Mingyoung Jeng, Ishraq Islam, David Levy +9 more

Abstract One of the challenges facing current Noisy-Intermediate-Scale-Quantum devices (NISQ) is achieving efficient quantum circuit measurement or readout. The process of extracting classical data from the quantum domain, termed in this work as quantum-to-classical (Q2C) data decoding, generally incurs significant overhead, since the quantum circuit needs to be sampled repeatedly to obtain useful data readout. In this paper, we propose and evaluate time-efficient and depth-optimized Q2C methods based on the multidimensional, multilevel-decomposable, quantum wavelet transform (QWT) whose packet and pyramidal forms are leveraged and optimized. We also propose a zero-depth technique that uses selective placement of measurement gates to perform the QWT operation. To demonstrate their efficiency, the proposed techniques are quantitatively evaluated in terms of execution time, circuit depth, and accuracy in comparison to existing Q2C techniques. Experimental evaluations of the proposed Q2C methods are performed using real high-resolution multispectral images on a 27-qubit state-of-the-art quantum computing device from IBM Quantum.

The Journal of Supercomputing•Jun 16, 2023•7 citations

Decoherence-Optimized Circuits for Multidimensional and Multilevel-Decomposable Quantum Wavelet Transform

Naveed Mahmud, Andrew MacGillivray, Manu Chaudhary +1 more

Algorithms such as quantum wavelet transform (QWT) can be utilized on quantum processors to gain significant speedup compared to their classical counterparts. Domains such as high-energy-physics and remote-sensing hyperspectral imagery require high compute capabilities and can benefit from applying QWT for dimension reduction of multidimensional data. However, quantum circuits for QWT include permutations that contribute to large overall circuit depth. Deep circuits pose a critical challenge for state-of-the-art quantum computers because of quantum decoherence. In this work, we propose QWT circuits, which are optimized in terms of circuit depth, to account for the effects of decoherence, and resulting in high fidelity and efficient implementation on quantum processors. We present the circuits in generalized forms and show that they can be used for multilevel decomposable, multidimensional wavelet operations. Experimental evaluation of the proposed circuits is performed through simulation using MATLAB and IBM-Q qasm, and implemented on a real 15-qubit quantum processor from IBM.

IEEE Internet Computing•Dec 9, 2021•8 citations

Towards Complete and Scalable Emulation of Quantum Algorithms on High-Performance Reconfigurable Computers

Esam El‐Araby, Naveed Mahmud, Mingyoung Jeng +9 more

Contemporary quantum computers face many critical challenges that limit their usefulness for practical applications. A primary limiting factor is classical-to-quantum (C2Q) data encoding, which requires specific circuits for quantum state initialization. The required state initialization circuits are often complex and violate decoherence constraints, particularly for I/O intensive applications. Existing Noisy Intermediate-Scale Quantum (NISQ) devices are noise-sensitive and have low quantum bit (qubit) counts, thus limiting the applicability of C2Q circuits for encoding large and realistic datasets. This has made the study of complete and realistic circuits that include data encoding challenging and has also led to a heavy dependency on costly and resource-intensive simulations on classical platforms. In this work, we propose a cost-effective, classical-hardware-accelerated framework for realistic and complete emulation of quantum algorithms. The emulation framework incorporates components for the critical C2Q data encoding process, as well as architectures for quantum algorithms such as the quantum Haar transform (QHT). The framework is used to investigate optimizations for C2Q and QHT algorithms, and the corresponding optimized quantum circuits are presented. The framework is implemented on a High-Performance Reconfigurable Computer (HPRC) which emulates the proposed QHT circuits combined with proposed C2Q data encoding methods. For performance benchmarks, CPU-based emulations and simulations on a state-of-the-art quantum computing simulator are also carried out. Results show that the proposed hardware-accelerated emulation framework is more efficient in terms of speed and scalability compared to CPU-based emulation and simulation.

IEEE Transactions on Computers•Feb 23, 2023•34 citations

Optimization of Quantum Read-Only Memory Circuits

Koustubh Phalak, Mahabubul Alam, Abdullah Ash Saki +2 more

Quantum computing is a rapidly expanding field with applications ranging from optimization all the way to complex machine learning tasks. Quantum memories, while lacking in practical quantum computers, have the potential to bring quantum advantage. In quantum machine learning applications for example, a quantum memory can simplify the data loading process and potentially accelerate the learning task. Quantum memory can also store intermediate quantum state of qubits that can be reused for computation. However, the depth, gate count and compilation time of quantum memories such as, Quantum Read Only Memory (QROM) scale exponentially with the number of address lines making them impractical in state-of-the-art Noisy Intermediate-Scale Quantum (NISQ) computers beyond 4-bit addresses. In this paper, we propose techniques such as, pre-decoding logic and qubit reset to reduce the depth and gate count of QROM circuits to target wider address ranges such as, 8-bits. The proposed approach reduces the number of gates and depth count by at least 2X compared to the naive implementation at only 36% qubit overhead. A reduction in circuit depth and gate count as high as 75X and compilation time by 85X at the cost of a maximum of 2.28X qubit overhead is observed. Experimentally, the fidelity with the proposed pre-decoding circuit compared to existing optimization approach is also higher (as much as 73% compared to 40.8%) under reduced error rates.

arXiv:2204.03097•IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD)•Oct 1, 2022•13 citations

Optimizing Quantum Circuits for Arbitrary State Synthesis and Initialization

Naveed Mahmud, Andrew MacGillivray, Manu Chaudhary +1 more

For practical usage of quantum systems in solving real-world problems, large amounts of classical data are required to be transferred/encoded to the quantum domain. Arbitrary classical data is usually encoded onto quantum devices by synthesizing and initializing a corresponding quantum state. Current techniques of arbitrary state synthesis, however, produce deep and complex quantum circuits, leading to low state fidelity and possible violations of decoherence constraints. In this work, we propose an improved methodology and optimized circuits for synthesizing any arbitrary quantum state from given classical data. Compared to existing methods, the proposed methodology results in circuits with lower gate count, lower circuit depth, and high state fidelity. The proposed methods are evaluated by simulation in MATLAB and IBM qasm, and realistic implementation on an IBM quantum device. The experimental results show a reduction in gate count and circuit depth by a factor of two over existing methods.

IEEE International System-on-Chip Conference (SOCC)•Sep 14, 2021•2 citations

Practical Applications of Quantum Computing

Esam El‐Araby, Manu Chaudhary, Ishraq Islam +5 more

With the rapid advancement of quantum computing technology, there is a strong motivation to explore suitable practical applications for quantum algorithms and quantum computers. This chapter focuses on reviewing recent research on practical applications of quantum computing, specifically dimension reduction, pattern recognition, quantum sorting, and quantum communications for which optimized/modified versions of the quantum wavelet transform (QWT) and Grover’s algorithm are presented. For practical implementations of the presented algorithms, this chapter also includes methodologies for classical-to-quantum (C2Q) data encoding and quantum-to-classical (Q2C) data decoding. Additionally, the chapter presents an efficient quantum sorting technique by combining perfect-shuffle and bitonic networks. In the domain of quantum communications, the chapter reviews a technique that combines chaotic communications with quantum key distribution (QKD) to enhance both security and communication range. The effectiveness of these techniques is validated through practical results obtained from experiments conducted on IBM-Q simulators and hardware, as well as on high-performance-reconfigurable-computers (HPRCs). This chapter aims to provide readers with a comprehensive understanding of these applications, covering the necessary prerequisites by showcasing the potential of quantum computing in various domains for innovative problem-solving.

IntechOpen eBooks•Nov 3, 2023•4 citations
Noisy Intermediate-Scale Quantum (NISQ) devices face many critical challenges that limit their usefulness for practical applications. A primary challenge is classical-to-quantum (C2Q) data encoding, which requires specific circuits for quantum state initialization, particularly for I/O intensive applications. The required state initialization circuits are often complex, and violate decoherence constraints. Another critical challenge for quantum computers is quantum state readout or quantum-to-classical (Q2C) data decoding. The general approach for Q2C involves repeated sampling of the quantum circuit, which often incurs significant overhead in the overall execution time. In this paper, we propose time-efficient methods for C2Q data encoding and Q2C data decoding for quantum algorithms. Decoherence optimized circuits for C2Q data encoding are presented along with analysis of their circuit depths. For Q2C, a novel approach based on more efficient sampling of the output state using the Quantum Wavelet Transform is proposed. The proposed methods are experimentally evaluated on a state-of-the-art quantum computing device from IBM Quantum using realistic multi-spectral data. Experimental results are consistent with our theoretical expectations and confirm the efficiency of our proposed methods compared to existing techniques. More specifically, our proposed C2Q method demonstrates a theoretical 2x reduction in circuit depth which resulted in improving the experimental execution time compared to the state-of-the-art, while our Q2C method achieved a maximum of 89% reduction in circuit sampling time.
Abstract One of the challenges facing current Noisy-Intermediate-Scale-Quantum devices (NISQ) is achieving efficient quantum circuit measurement or readout. The process of extracting classical data from the quantum domain, termed in this work as quantum-to-classical (Q2C) data decoding, generally incurs significant overhead, since the quantum circuit needs to be sampled repeatedly to obtain useful data readout. In this paper, we propose and evaluate time-efficient and depth-optimized Q2C methods based on the multidimensional, multilevel-decomposable, quantum wavelet transform (QWT) whose packet and pyramidal forms are leveraged and optimized. We also propose a zero-depth technique that uses selective placement of measurement gates to perform the QWT operation. To demonstrate their efficiency, the proposed techniques are quantitatively evaluated in terms of execution time, circuit depth, and accuracy in comparison to existing Q2C techniques. Experimental evaluations of the proposed Q2C methods are performed using real high-resolution multispectral images on a 27-qubit state-of-the-art quantum computing device from IBM Quantum.
Algorithms such as quantum wavelet transform (QWT) can be utilized on quantum processors to gain significant speedup compared to their classical counterparts. Domains such as high-energy-physics and remote-sensing hyperspectral imagery require high compute capabilities and can benefit from applying QWT for dimension reduction of multidimensional data. However, quantum circuits for QWT include permutations that contribute to large overall circuit depth. Deep circuits pose a critical challenge for state-of-the-art quantum computers because of quantum decoherence. In this work, we propose QWT circuits, which are optimized in terms of circuit depth, to account for the effects of decoherence, and resulting in high fidelity and efficient implementation on quantum processors. We present the circuits in generalized forms and show that they can be used for multilevel decomposable, multidimensional wavelet operations. Experimental evaluation of the proposed circuits is performed through simulation using MATLAB and IBM-Q qasm, and implemented on a real 15-qubit quantum processor from IBM.
Contemporary quantum computers face many critical challenges that limit their usefulness for practical applications. A primary limiting factor is classical-to-quantum (C2Q) data encoding, which requires specific circuits for quantum state initialization. The required state initialization circuits are often complex and violate decoherence constraints, particularly for I/O intensive applications. Existing Noisy Intermediate-Scale Quantum (NISQ) devices are noise-sensitive and have low quantum bit (qubit) counts, thus limiting the applicability of C2Q circuits for encoding large and realistic datasets. This has made the study of complete and realistic circuits that include data encoding challenging and has also led to a heavy dependency on costly and resource-intensive simulations on classical platforms. In this work, we propose a cost-effective, classical-hardware-accelerated framework for realistic and complete emulation of quantum algorithms. The emulation framework incorporates components for the critical C2Q data encoding process, as well as architectures for quantum algorithms such as the quantum Haar transform (QHT). The framework is used to investigate optimizations for C2Q and QHT algorithms, and the corresponding optimized quantum circuits are presented. The framework is implemented on a High-Performance Reconfigurable Computer (HPRC) which emulates the proposed QHT circuits combined with proposed C2Q data encoding methods. For performance benchmarks, CPU-based emulations and simulations on a state-of-the-art quantum computing simulator are also carried out. Results show that the proposed hardware-accelerated emulation framework is more efficient in terms of speed and scalability compared to CPU-based emulation and simulation.
Quantum computing is a rapidly expanding field with applications ranging from optimization all the way to complex machine learning tasks. Quantum memories, while lacking in practical quantum computers, have the potential to bring quantum advantage. In quantum machine learning applications for example, a quantum memory can simplify the data loading process and potentially accelerate the learning task. Quantum memory can also store intermediate quantum state of qubits that can be reused for computation. However, the depth, gate count and compilation time of quantum memories such as, Quantum Read Only Memory (QROM) scale exponentially with the number of address lines making them impractical in state-of-the-art Noisy Intermediate-Scale Quantum (NISQ) computers beyond 4-bit addresses. In this paper, we propose techniques such as, pre-decoding logic and qubit reset to reduce the depth and gate count of QROM circuits to target wider address ranges such as, 8-bits. The proposed approach reduces the number of gates and depth count by at least 2X compared to the naive implementation at only 36% qubit overhead. A reduction in circuit depth and gate count as high as 75X and compilation time by 85X at the cost of a maximum of 2.28X qubit overhead is observed. Experimentally, the fidelity with the proposed pre-decoding circuit compared to existing optimization approach is also higher (as much as 73% compared to 40.8%) under reduced error rates.
For practical usage of quantum systems in solving real-world problems, large amounts of classical data are required to be transferred/encoded to the quantum domain. Arbitrary classical data is usually encoded onto quantum devices by synthesizing and initializing a corresponding quantum state. Current techniques of arbitrary state synthesis, however, produce deep and complex quantum circuits, leading to low state fidelity and possible violations of decoherence constraints. In this work, we propose an improved methodology and optimized circuits for synthesizing any arbitrary quantum state from given classical data. Compared to existing methods, the proposed methodology results in circuits with lower gate count, lower circuit depth, and high state fidelity. The proposed methods are evaluated by simulation in MATLAB and IBM qasm, and realistic implementation on an IBM quantum device. The experimental results show a reduction in gate count and circuit depth by a factor of two over existing methods.
With the rapid advancement of quantum computing technology, there is a strong motivation to explore suitable practical applications for quantum algorithms and quantum computers. This chapter focuses on reviewing recent research on practical applications of quantum computing, specifically dimension reduction, pattern recognition, quantum sorting, and quantum communications for which optimized/modified versions of the quantum wavelet transform (QWT) and Grover’s algorithm are presented. For practical implementations of the presented algorithms, this chapter also includes methodologies for classical-to-quantum (C2Q) data encoding and quantum-to-classical (Q2C) data decoding. Additionally, the chapter presents an efficient quantum sorting technique by combining perfect-shuffle and bitonic networks. In the domain of quantum communications, the chapter reviews a technique that combines chaotic communications with quantum key distribution (QKD) to enhance both security and communication range. The effectiveness of these techniques is validated through practical results obtained from experiments conducted on IBM-Q simulators and hardware, as well as on high-performance-reconfigurable-computers (HPRCs). This chapter aims to provide readers with a comprehensive understanding of these applications, covering the necessary prerequisites by showcasing the potential of quantum computing in various domains for innovative problem-solving.