Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo p and Order q

Abstract: The discrete logarithm problem (DLP) over finite fields, commonly used in classical cryptography, has no known polynomial-time algorithm on classical computers. However, Shor has provided its polynomial-time algorithm on quantum computers. Nevertheless, there are only few examples simulating quantum circuits that operate on general pairs of modulo p and order q. In this article, […]

Engineering Quantum Error Correction Codes Using Evolutionary Algorithms

Quantum error correction and the use of quantum error correction codes are likely to be essential for the realization of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes that are tailored for a particular error model may have much better performance. For more about this article see link below. […]

Variational Quantum Algorithms for Differential Equations on a Noisy Quantum Computer

The role of differential equations (DEs) in science and engineering is of paramount importance, as they provide the mathematical framework for a multitude of natural phenomena. Since quantum computers promise significant advantages over classical computers, quantum algorithms for the solution of DEs have received a lot of attention. Particularly interesting are algorithms that offer advantages […]

Learning a Quantum Computer’s Capability

Accurately predicting a quantum computer’s capability—which circuits it can run and how well it can run them—is a foundational goal of quantum characterization and benchmarking. As modern quantum computers become increasingly hard to simulate, we must develop accurate and scalable predictive capability models to help researchers and stakeholders decide which quantum computers to build and […]

Approximate Solutions of Combinatorial Problems via Quantum Relaxations

Combinatorial problems are formulated to find optimal designs within a fixed set of constraints and are commonly found across diverse engineering and scientific domains. Understanding how to best use quantum computers for combinatorial optimization remains an ongoing area of study. Here, we propose new methods for producing approximate solutions to quadratic unconstrained binary optimization problems, […]

Scalable Full-Stack Benchmarks for Quantum Computers

Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor’s rate of errors when running these circuits. Here, we introduce a general technique for creating efficient benchmarks from any set of quantum computations, specified by unitary circuits. Our benchmarks assess […]

Multiobjective Optimization and Network Routing With Near-Term Quantum Computers

Multiobjective optimization is a ubiquitous problem that arises naturally in many scientific and industrial areas. Network routing optimization with multiobjective performance demands falls into this problem class, and finding good quality solutions at large scales is generally challenging. In this work, we develop a scheme with which near-term quantum computers can be applied to solve […]

Simulating Quantum Field Theories on Gate-Based Quantum Computers

We implement a simulation of a quantum field theory in 1+1 space–time dimensions on a gate-based quantum computer using the light-front formulation of the theory. The nonperturbative simulation of the Yukawa model field theory is verified on IBM’s simulator and is also demonstrated on a small-scale IBM circuit-based quantum processor, on the cloud, using IBM […]

Testing and Debugging Quantum Circuits

This article introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: amplitude–permutation, phase-modulation, and amplitude–redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches tailored to the unique properties of each circuit type. For amplitude–permutation circuits, we propose techniques to correct amplitude–permutations mimicking classical operations. […]

Testing and Debugging Quantum Circuits

This article introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: amplitude–permutation, phase-modulation, and amplitude–redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches tailored to the unique properties of each circuit type. For amplitude–permutation circuits, we propose techniques to correct amplitude–permutations mimicking classical operations. […]