Aug 2026· National Aerospace and Electronics Conference· pp. 199-203· 0 citations· 15 references
Abstract
With the exponentially increasing global data volumes it is challenging to meet the ultra-low latency requirements of the next-generation sophisticated applications using the existing computing resources. Though multiple existing methods and approaches such as edge-and-cloud computing, high performance computing (HPC), and specialized accelerators address the processing of voluminous data they suffer from numerous drawbacks. Some of them includes higher power consumption, expensive installation process, and lack of data privacy mechanisms. Quantum computing due to its inherent properties such as entanglement, and superposition becomes an ideal candidate for processing high-dimensional as well as exponentially growing data requirements. However, majority of the existing quantum computing researches focus on the individualized circuit implementation. But the modular quantum testbed is integral to systematic circuit analysis within emerging quantum computing architectures. In this paper, we propose Python based multi-layered quantum testbed that integrates modular circuit construction, simulation, and measurement analysis. Additionally, this paper includes preliminary arithmetic results from our testbed besides including a comparison between classical and quantum computational algorithms. This testbed will lay a solid foundation towards building a sophisticated quantum architectures for security related applications.
To address high latency and parameter heterogeneity in post-quantum cryptography, this paper proposes a scalable hardware acceleration scheme. To mitigate the polynomial multiplication bottleneck, we introduce the 2 Preprocess-then-NTT (Number Theoretic Transform) architecture. By decomposing complex polynomial transfo...
Bin Li, Bo-Yao Hu, Shi-Liang Yu et al.· International Test Conferenc...· 0 citations
With the ongoing standardization of Post-Quantum Cryptography (PQC), polynomial multiplication in lattice-based cryptographic schemes has emerged as a critical performance bottleneck. The Number Theoretic Transform (NTT), as the core technique for accelerating such computations, plays a decisive role in determining the...
Qing-Xin Xie, Li-Ping Wang, Xiao Liu et al.· International Test Conferenc...· 0 citations
Quantum computing currently functions not as standalone systems, but rather as auxiliary accelerators dependent on classical processors. This situation has led to the emergence of Classical-Quantum Hybrid architecture, which necessitates the integration of classical software with quantum algorithms. However, monolithic...
Niyazi Furkan Bar, M. Karakose· Automation, Control, and Inf...· 0 citations
The proliferation of Internet of Things (IoT) devices has created a critical demand for highly energy-efficient and timing-accurate Very Large-Scale Integration (VLSI) circuits. Traditional simulation and modeling techniques often fall short in capturing real-time performance metrics, particularly under dynamic operati...
This work shows that the compilation method Parity Twine perfectly complements the hardware's capabilities to perform tasks such as the quantum Fourier transform or QAOA, and describes an error detection technique native to Parity Twine, which EO qubits can leverage in a unique and advantageous way to improve algorithm...
F. Lohof, Florian Ginzel, Wolfgang Lechner· 1 citation
Quantum computing leverages quantum mechanics to perform complex computations efficiently, yet its practical implementation is hindered by hardware-software interdependence and quantum state instability. This paper advances lightweight FPGA-based quantum emulation by incorporating a universal quantum gate set, includin...