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

SYSTEM AND METHOD OF OPTIMIZING INSTRUCTIONS FOR QUANTUM COMPUTERS

Frederic T. Chong, I. Yunong Shi, Nelson Leung, Pranav Gokhale, Henry Hoffman, David Schuster

Published Sep 12, 2019• 0 citations
Publisher

Abstract

A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.

DOI
10.6082/4dczk-ayt46

Related papers

System and method of optimizing instructions for quantum computers

Frederic T. Chong, I. Yunong Shi, Nelson Leung +3 more

A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.

•Sep 12, 2019•0 citations

System and Method of Partial Compilation With Variational Algorithms for Quantum Computers

Frederic T. Chong, Pranav Gokhale, Yongshan Ding +1 more

A computing system includes a quantum processor with qubits, a classical memory including a quantum program defining a plurality of instructions in a source language, and a classical processor configured to: (i) receive a circuit of gates representing a quantum program for a variational algorithm in which computation is interleaved with compilation; (ii) identify a plurality of blocks, each block includes a subcircuit of gates, leaving one or more remainder subcircuits of the circuit of gates outside of the plurality of blocks; (iii) pre-compile each block of the plurality of blocks with a pulse generation program to generate a plurality of pre-compiled blocks including control pulses configured to perform the associated block on the quantum processor; and (iv) iteratively execute the quantum program using the pre-compiled blocks as static during runtime and recompiling the one or more remainder subcircuits on the classical processor at each iteration of execution.

•Sep 9, 2020•0 citations

Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers

Yunong Shi, Nelson Leung, Pranav Gokhale +4 more

Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and 2-qubit (quantum bit) gates. Quantum compiler frameworks translate this quantum assembly to electric signals (called control pulses) that implement the specified computation on specific physical devices. However, there is a mismatch between the operations defined by the 1- and 2-qubit logical ISA and their underlying physical implementation, so the current practice of directly translating logical instructions into control pulses results in inefficient, high-latency programs. To address this inefficiency, we propose a universal quantum compilation methodology that aggregates multiple logical operations into larger units that manipulate up to 10 qubits at a time. Our methodology then optimizes these aggregates by (1) finding commutative intermediate operations that result in more efficient schedules and (2) creating custom control pulses optimized for the aggregate (instead of individual 1- and 2-qubit operations). Compared to the standard gate-based compilation, the proposed approach realizes a deeper vertical integration of high-level quantum software and low-level, physical quantum hardware. We evaluate our approach on important near-term quantum applications on simulations of superconducting quantum architectures. Our proposed approach provides a mean speedup of $5\times$, with a maximum of $10\times$. Because latency directly affects the feasibility of quantum computation, our results not only improve performance but also have the potential to enable quantum computation sooner than otherwise possible.

arXiv:1902.01474•International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)•Apr 4, 2019•133 citations

Accelerated pattern matching method on a quantum computing system

Pradeep Niroula

A method of determining a pattern in a sequence of bits using a quantum computing system includes setting a first register of a quantum processor in a superposition of a plurality of string index states, encoding a bit string in a second register of the quantum processor, encoding a bit pattern in a third register of the quantum processor, circularly shifting qubits of the second register conditioned on the first register, amplifying an amplitude of a state combined with the first register in which the circularly shifted qubits of the second register matches qubits of the third register, measuring an amplitude of the first register and determining a string index state of the plurality of string index states associated with the amplified state, and outputting, by use of a classical computer, a string index associated with the first register in the measured state.

•Mar 18, 2024•0 citations

Quantum computing using chiral qubits

Dmitri E. Kharzeev

An apparatus for performing quantum computing includes multiple qubits, each of at least a subset of the qubits comprising a loop formed of a Dirac or Weyl semimetal and having at least two stable quantum states. The apparatus further includes at least one terahertz cavity coupled with the qubits, the terahertz cavity being configured to detect the quantum states of the qubits. Each of at least the subset of qubits is configured to receive a circularly polarized radiation source. The radiation source is adapted to excite a chiral current in each of at least the subset of qubits, the quantum states of the plurality of qubits being a function of the chiral current.

•Apr 27, 2023•1 citation

Kuantum modellerden kuantum programlara: Petri ağları, algoritmalar ve derleme

Syed Asad Shah

This thesis introduces a simplified quantum Petri net (QPN) model and uses this model to generalize classical SISO, SIMO, MISO, MIMO, and Priority buffers to their quantum counterparts.It provides a primitive storage element, namely a quantum S-R flip-flop and describes two different such flip-flop designs using quantum NOT, CNOT, CCNOT, and SWAP gates.Each of the quantum S-R flip-flops can be replicated to obtain a quantum register for any given number of qubits.The aforementioned quantum buffers are then obtained using the simplified QPN model and quantum registers.The quantum S-R flip-flop and quantum buffer designs have been tested using OpenQASM 2.0 and Qiskit programs on IBM quantum computers and simulators and the results validate their expected operations.The thesis also addresses the problem of reachability in bounded quantum Petri nets (QPNs).The proposed approach exploits quantum parallelism to construct a superposition over all reachable markings from the initial marking.Grover's amplitude amplification algorithm is then applied to efficiently identify a desired target marking, while ancillary q-tokens used solely for transition control are excluded from the search space, significantly reducing its size.Theoretical analysis shows that our approach achieves a quadratic speed-up over classical exhaustive algorithms.Experimental results also confirm the correctness and feasibility of the proposed quantum algorithm for solving the bounded reachability problem in Quantum Petri Nets.A quantum algorithm for the Subset Sum Problem is also developed.The proposed approach exploits quantum superposition to represent all candidate subsets simultaneously and uses reversible controlled addition to compute their corresponding subset sums.Grover's amplitude amplification algorithm is then applied to increase the probability of measuring subsets whose sum matches the desired target.Theoretical analysis shows that our approach achieves a quadratic iii iv speed-up over classical exhaustive algorithms.The algorithm is implemented in Q# and evaluated using both valid and invalid target sums.Experimental results obtained using a Q# implementation confirm that the algorithm can correctly identify valid subsets for both single-solution and multiple-solution cases.Finally, the thesis introduces AQASM, an Abstract Quantum Assembly Language, together with a compiler framework for translating Quantum Intermediate Representation (QIR) programs into a backend-independent assembly representation.AQASM explicitly represents quantum and classical operations, synchronization, timing information, and parallel execution.The compiler performs preprocessing, instruction lowering, gate decomposition, dependency analysis, parallel-region generation, synchronization, and abstract scheduling.An abstract backend model with all-to-all qubit connectivity and representative operation durations is used to evaluate the compilation and scheduling process without targeting a specific quantum processor.Experimental evaluation using the Bernstein-Vazirani and quantum Subset Sum programs shows that the compiler correctly translates supported QIR operations, preserves instruction dependencies, identifies opportunities for parallel execution, and generates scheduled AQASM programs according to the assumptions of the abstract backend model.

•Sep 1, 2026•0 citations
A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.
A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.
A computing system includes a quantum processor with qubits, a classical memory including a quantum program defining a plurality of instructions in a source language, and a classical processor configured to: (i) receive a circuit of gates representing a quantum program for a variational algorithm in which computation is interleaved with compilation; (ii) identify a plurality of blocks, each block includes a subcircuit of gates, leaving one or more remainder subcircuits of the circuit of gates outside of the plurality of blocks; (iii) pre-compile each block of the plurality of blocks with a pulse generation program to generate a plurality of pre-compiled blocks including control pulses configured to perform the associated block on the quantum processor; and (iv) iteratively execute the quantum program using the pre-compiled blocks as static during runtime and recompiling the one or more remainder subcircuits on the classical processor at each iteration of execution.
Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and 2-qubit (quantum bit) gates. Quantum compiler frameworks translate this quantum assembly to electric signals (called control pulses) that implement the specified computation on specific physical devices. However, there is a mismatch between the operations defined by the 1- and 2-qubit logical ISA and their underlying physical implementation, so the current practice of directly translating logical instructions into control pulses results in inefficient, high-latency programs. To address this inefficiency, we propose a universal quantum compilation methodology that aggregates multiple logical operations into larger units that manipulate up to 10 qubits at a time. Our methodology then optimizes these aggregates by (1) finding commutative intermediate operations that result in more efficient schedules and (2) creating custom control pulses optimized for the aggregate (instead of individual 1- and 2-qubit operations). Compared to the standard gate-based compilation, the proposed approach realizes a deeper vertical integration of high-level quantum software and low-level, physical quantum hardware. We evaluate our approach on important near-term quantum applications on simulations of superconducting quantum architectures. Our proposed approach provides a mean speedup of 5×5\times5×, with a maximum of 10×10\times10×. Because latency directly affects the feasibility of quantum computation, our results not only improve performance but also have the potential to enable quantum computation sooner than otherwise possible.
A method of determining a pattern in a sequence of bits using a quantum computing system includes setting a first register of a quantum processor in a superposition of a plurality of string index states, encoding a bit string in a second register of the quantum processor, encoding a bit pattern in a third register of the quantum processor, circularly shifting qubits of the second register conditioned on the first register, amplifying an amplitude of a state combined with the first register in which the circularly shifted qubits of the second register matches qubits of the third register, measuring an amplitude of the first register and determining a string index state of the plurality of string index states associated with the amplified state, and outputting, by use of a classical computer, a string index associated with the first register in the measured state.
An apparatus for performing quantum computing includes multiple qubits, each of at least a subset of the qubits comprising a loop formed of a Dirac or Weyl semimetal and having at least two stable quantum states. The apparatus further includes at least one terahertz cavity coupled with the qubits, the terahertz cavity being configured to detect the quantum states of the qubits. Each of at least the subset of qubits is configured to receive a circularly polarized radiation source. The radiation source is adapted to excite a chiral current in each of at least the subset of qubits, the quantum states of the plurality of qubits being a function of the chiral current.
This thesis introduces a simplified quantum Petri net (QPN) model and uses this model to generalize classical SISO, SIMO, MISO, MIMO, and Priority buffers to their quantum counterparts.It provides a primitive storage element, namely a quantum S-R flip-flop and describes two different such flip-flop designs using quantum NOT, CNOT, CCNOT, and SWAP gates.Each of the quantum S-R flip-flops can be replicated to obtain a quantum register for any given number of qubits.The aforementioned quantum buffers are then obtained using the simplified QPN model and quantum registers.The quantum S-R flip-flop and quantum buffer designs have been tested using OpenQASM 2.0 and Qiskit programs on IBM quantum computers and simulators and the results validate their expected operations.The thesis also addresses the problem of reachability in bounded quantum Petri nets (QPNs).The proposed approach exploits quantum parallelism to construct a superposition over all reachable markings from the initial marking.Grover's amplitude amplification algorithm is then applied to efficiently identify a desired target marking, while ancillary q-tokens used solely for transition control are excluded from the search space, significantly reducing its size.Theoretical analysis shows that our approach achieves a quadratic speed-up over classical exhaustive algorithms.Experimental results also confirm the correctness and feasibility of the proposed quantum algorithm for solving the bounded reachability problem in Quantum Petri Nets.A quantum algorithm for the Subset Sum Problem is also developed.The proposed approach exploits quantum superposition to represent all candidate subsets simultaneously and uses reversible controlled addition to compute their corresponding subset sums.Grover's amplitude amplification algorithm is then applied to increase the probability of measuring subsets whose sum matches the desired target.Theoretical analysis shows that our approach achieves a quadratic iii iv speed-up over classical exhaustive algorithms.The algorithm is implemented in Q# and evaluated using both valid and invalid target sums.Experimental results obtained using a Q# implementation confirm that the algorithm can correctly identify valid subsets for both single-solution and multiple-solution cases.Finally, the thesis introduces AQASM, an Abstract Quantum Assembly Language, together with a compiler framework for translating Quantum Intermediate Representation (QIR) programs into a backend-independent assembly representation.AQASM explicitly represents quantum and classical operations, synchronization, timing information, and parallel execution.The compiler performs preprocessing, instruction lowering, gate decomposition, dependency analysis, parallel-region generation, synchronization, and abstract scheduling.An abstract backend model with all-to-all qubit connectivity and representative operation durations is used to evaluate the compilation and scheduling process without targeting a specific quantum processor.Experimental evaluation using the Bernstein-Vazirani and quantum Subset Sum programs shows that the compiler correctly translates supported QIR operations, preserves instruction dependencies, identifies opportunities for parallel execution, and generates scheduled AQASM programs according to the assumptions of the abstract backend model.