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

APS

Complex Instruction Set Quantum Computing

Gary D. Sanders, K. W. Kim, William C. Holton

Published Mar 1, 1998• 0 citations
OpenAlex

Related papers

Instruction Set Architectures for Quantum Processing Units

Keith A. Britt, Travis S. Humble

arXiv:1707.06202•Lecture notes in computer science•Jan 1, 2017•12 citations

A Quantum Instruction Set for Real Quantum Computer.

Mayumi Oto, Hironori Nakajo, Shiro Takata +1 more

情報処理学会論文誌•Jan 1, 2002•0 citations

Quantum computing with complex instruction sets

Gary D. Sanders, K. W. Kim, William C. Holton

In most current quantum computers simple electromagnetic pulses implement computations using a minimal set of universal gates. We propose an approach in which quantum control techniques combined with flexible electromagnetic pulse shaping are used to replace several universal gates with a single instruction. We show that this complex instruction set approach can significantly reduce the time required to perform quantum computations.

Physical Review A•Feb 1, 1999•23 citations

Quantum Computing Overview

Osama Babakhel, Mujahid Tabassum, Tripti Sharma

Information systems engineering and management•Jan 1, 2025•0 citations

EQISA: Energy-efficient Quantum Instruction Set Architecture using Sparse Dictionary Learning

Sibasish Mishra, Aritra Sarkar, Sebastian Feld

The scalability of quantum computing in supporting sophisticated algorithms critically depends not only on qubit quality and error handling, but also on the efficiency of classical control, constrained by the cryogenic control bandwidth and energy budget. In this work, we address this challenge by investigating the algorithmic complexity of quantum circuits at the instruction set architecture (ISA) level. We introduce an energy-efficient quantum instruction set architecture (EQISA) that synthesizes quantum circuits in a discrete Solovay-Kitaev basis of fixed depth and encodes instruction streams using a sparse dictionary learned from decomposing a set of Haar-random unitaries, followed by entropy-optimal Huffman coding and an additional lossless bzip2 compression stage. This approach is evaluated on benchmark quantum circuits demonstrating over 60% compression of quantum instruction streams across system sizes, enabling proportional reductions in classical control energy and communication overhead without loss of computational fidelity. Beyond compression, EQISA facilitates the discovery of higher-level composable abstractions in quantum circuits and provides estimates of quantum algorithmic complexity. These findings position EQISA as an impactful direction for improving the energy efficiency and scalability of quantum control architectures.

quant-pharXiv:2603.20646•Mar 24, 2026•2 citations

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

Jayavrinda Vrindavanam Akshay, Anirudh Narayanan, N. Chandrashekar +2 more

Abstract In the overall context of enhanced application of quantum computing into multitude of areas, the paper explores and implements classical encryption algorithms both in traditional and quantum computing environments. Towards this, the classical encryption algorithms such as Blowfish, RSA and ECC are executed in both classical and quantum environments. The result shows that the key generated in the classical hardware is limited to 64-bit as envisaged; the quantum key is generated found to be complex as the instruction set changes from classical instruction set to quantum instruction set. Further, the additional factor of randomness in quantum computing increases the security of the cipher text, which is transmitted over the internet, showing insights for practical applications.

•Apr 16, 2024•1 citation
The scalability of quantum computing in supporting sophisticated algorithms critically depends not only on qubit quality and error handling, but also on the efficiency of classical control, constrained by the cryogenic control bandwidth and energy budget. In this work, we address this challenge by investigating the algorithmic complexity of quantum circuits at the instruction set architecture (ISA) level. We introduce an energy-efficient quantum instruction set architecture (EQISA) that synthesizes quantum circuits in a discrete Solovay-Kitaev basis of fixed depth and encodes instruction streams using a sparse dictionary learned from decomposing a set of Haar-random unitaries, followed by entropy-optimal Huffman coding and an additional lossless bzip2 compression stage. This approach is evaluated on benchmark quantum circuits demonstrating over 60% compression of quantum instruction streams across system sizes, enabling proportional reductions in classical control energy and communication overhead without loss of computational fidelity. Beyond compression, EQISA facilitates the discovery of higher-level composable abstractions in quantum circuits and provides estimates of quantum algorithmic complexity. These findings position EQISA as an impactful direction for improving the energy efficiency and scalability of quantum control architectures.
Abstract In the overall context of enhanced application of quantum computing into multitude of areas, the paper explores and implements classical encryption algorithms both in traditional and quantum computing environments. Towards this, the classical encryption algorithms such as Blowfish, RSA and ECC are executed in both classical and quantum environments. The result shows that the key generated in the classical hardware is limited to 64-bit as envisaged; the quantum key is generated found to be complex as the instruction set changes from classical instruction set to quantum instruction set. Further, the additional factor of randomness in quantum computing increases the security of the cipher text, which is transmitted over the internet, showing insights for practical applications.