Journal of Modern Optics

RISQ - reduced instruction set quantum computers

Klaus Mølmer, Anders Sørensen

Published Nov 20, 2000• 1 citation

Abstract

Candidates for quantum computing which offer only restricted control, e.g., due to lack of access to individual qubits, are not useful for general purpose quantum computing.We present concrete proposals for the use of systems with such limitations as RISQreduced instruction set quantum computers and devices -for simulation of quantum dynamics, for multi-particle entanglement and squeezing of collective spin variables.These tasks are useful in their own right, and they also provide experimental probes for the functioning of quantum gates in pre-mature proto-types of quantum computers.

DOI: 10.1080/095003400750039519

Related papers

RISQ-reduced instruction set quantum computers

Klaus Mølmer, Anders S⊘rensen

Candidates for quantum computing which offer only restricted control, e.g. due to lack of access to individual qubits, are not useful for general purpose quantum computing. We present concrete proposals for the use of systems with such limitations as RISQ-reduced instruction set quantum computers and devices-for simulation of quantum dynamics, for multi-particle entanglement and squeezing of collective spin variables. These tasks are useful in their own right, and they also provide experimental probes for the functioning of quantum gates in premature prototypes of quantum computers.

arXiv:quant-ph/0004014Journal of Modern OpticsNov 1, 20008 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 AFeb 1, 199925 citations

Quantum computers: operating principle and development prospects

А. І. Тасьмук, В. В. Мартинюк, В. Мартынюк

The article reviews the concepts and laws of quantum computers and compares them with classical computing systems. It explores qubit, superposition, and quantum entanglement. It discusses the technical limitations of current quantum processor design and the potential applications of quantum processors in scientific work and information security research.

Jan 1, 20260 citations

Quantum CISC Compilation by Optimal Control and Scalable Assembly of Complex Instruction Sets beyond Two-Qubit Gates

T. Schulte-Herbrueggen, Andreas K. Spörl, Steffen J. Glaser

We present a quantum CISC compiler and show how to assemble complex instruction sets in a scalable way. Enlarging the toolbox of universal gates by optimised complex multi-qubit instruction sets thus paves the way to fight decoherence for realistic settings. Compiling a quantum module into the machine code for steering a concrete quantum hardware device lends itself to be tackled by means of optimal quantum control. To this end, there are two opposite approaches: (i) one may use a decomposition into the restricted instruction set (RISC) of universal one- and two-qubit gates, which in turn have prefabricated translations into the machine code or (ii) one may prefer to generate the entire target module directly by a complex instruction set (CISC) of available controls. Here we advocate direct compilation up to the limit of system size a classical high-performance parallel computer cluster can reasonably handle. For going beyond these limits, i.e. for large systems we propose a combined way, namely (iii) to make recursive use of medium-sized building blocks generated by optimal control in the sense of a quantum CISC compiler. The advantage of the method over standard RISC compilations into one- and two-qubit universal gates is explored on the parallel cluster HLRB-II (with a total LINPACK performance of 63.3 TFlops/s) for the quantum Fourier transform, the indirect SWAP gate as well as for multiply-controlled CNOT gates. Implications for upper limits to time complexities are also derived.

arXiv:0712.3227Dec 19, 20076 citations

Designing Calibration and Expressivity-Efficient Instruction Sets for Quantum Computing

Lingling Lao, Prakash Murali, Margaret Martonosi +1 more

Near-term quantum computing (QC) systems have limited qubit counts, high gate (instruction) error rates, and typically support a minimal instruction set having one type of two-qubit gate (2Q). To reduce program instruction counts and improve application expressivity, vendors have proposed, and shown proof-of-concept demonstrations of richer instruction sets such as XY gates (Rigetti) and fSim gates (Google). These instruction sets comprise of families of 2Q gate types parameterized by continuous qubit rotation angles. That is, it allows a large set of different physical operations to be realized on the qubits, based on the input angles. However, having such a large number of gate types is problematic because each gate type has to be calibrated periodically, across the full system, to obtain high fidelity implementations. This results in substantial recurring calibration overheads even on current systems which use only a few gate types. Our work aims to navigate this tradeoff between application expressivity and calibration overhead, and identify what instructions vendors should implement to get the best expressivity with acceptable calibration time.Studying this tradeoff is challenging because of the diversity in QC application requirements, the need to optimize applications for widely different hardware gate types and noise variations across gate types. Therefore, our work develops NuOp, a flexible compilation pass based on numerical optimization, to efficiently decompose application operations into arbitrary hardware gate types. Using NuOp and four important quantum applications, we study the instruction set proposals of Rigetti and Google, with realistic noise simulations and a calibration model. Our experiments show that implementing 4-8 types of 2Q gates is sufficient to attain nearly the same expressivity as a full continuous gate family, while reducing the calibration overhead by two orders of magnitude. With several vendors proposing rich gate families as means to higher fidelity, our work has potential to provide valuable instruction set design guidance for near-term QC systems.

arXiv:2106.15490Proceedings - International Symposium on Computer Architecture/ProceedingsJun 1, 202123 citations

Entangled Futures: Quantum Computing's Potential and Challenges in Computer Science

Devki Nandan Jha, Jonte R. Hance, Tomasz Szydło +3 more

Quantum computing represents a fundamental shift in computation, promising to solve problems currently intractable for classical computers. However, misconceptions persist; quantum computers are not universally faster, nor do they replace classical systems. Current Noisy Intermediate-Scale Quantum (NISQ) devices face significant challenges, including decoherence, high error rates, and limited scalability. Additionally, leveraging quantum systems requires rethinking traditional computing principles, adopting different programming models, and addressing the complexities of integrating quantum and classical workflows, making their practical use in computer science both demanding and non-trivial. This article provides a system-level perspective on quantum computing for computer scientists, software engineers, and IT professionals, examining its current capabilities, key architectural and software challenges, and potential paths toward quantum advantage in real-world applications within hybrid quantum-classical environments.

arXiv:2610.29640Oct 21, 20260 citations