Quantum circuit Archives - Page 3 of 7 - IEEE Transactions on Quantum Engineering

Quantum Circuit Compilation for Trapped-Ion Processors With the Drive-Through Architecture

March 6, 2025Che-Ming Chang, Jie-Hong Roland Jiang, Dah-Wei Chiou, Ting Hsu, Guin-Dar LinQuantum SoftwareComputer architecture, Hardware, Heating systems, Ions, Logic gates, Program processors, Quantum cascade lasers, Quantum circuit, Quantum computing, Qubit

Abstract: Trapped-ion technologies stand out as leading contenders in the pursuit of quantum computing, due to their capacity for highly entangled qubits. Among many proposed trapped-ion architectures, the “drive-through” architecture has drawn increasing attention, notably for its remarkable ability to minimize heat generation, which is crucial for low-temperature operation and thermal noise reduction, thus reliable […]

Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems

March 6, 2025Rei Sato, Cui Gordon, Kazuhiro Saito, Hideyuki Kawashima, Tetsuro Nikuni, Shohei WatabeQuantum ComputingComplexity theory, Costs, Encoding, Heuristic algorithms, Optimization, Quantum algorithm, Quantum circuit, Search problems, Traveling salesman problems, Urban areas

Quantum search algorithms, such as Grover’s algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state—an equal superposition of all feasible solutions satisfying the […]

Explicit Quantum Circuit for Simulating the Advection–Diffusion–Reaction Dynamics

February 21, 2025Claudio Sanavio, Enea Mauri, Sauro SucciQuantum ComputingComputational fluid dynamics, Convergence, Encoding, Logic gates, Logistics, Mathematical models, Polynomials, Quantum algorithm, Quantum circuit, Qubit

We assess the convergence of the Carleman linearization of advection–diffusion–reaction (ADR) equations with a logistic nonlinearity. It is shown that five Carleman iterates provide a satisfactory approximation of the original ADR across a broad range of parameters and strength of nonlinearity. To assess the feasibility of a quantum algorithm based on this linearization, we analyze […]

Generating Shuttling Procedures for Constrained Silicon Quantum Dot Array

February 14, 2025Naoto Sato, Tomonori Sekiguchi, Takeru Utsugi, Hiroyuki MizunoQuantum SoftwareCrosstalk, Electrons, Large scale integration, Logic gates, Quantum circuit, Quantum dots, Qubit, Silicon, Symbols, Voltage measurement

In silicon quantum computers, a single electron is trapped in a microstructure called a quantum dot, and its spin is used as a qubit. For large-scale integration of qubits, we previously proposed an approach of sharing a control gate in the row or column of a 2-D quantum dot array. In our array, the shuttling […]

Variational Quantum Algorithms for Differential Equations on a Noisy Quantum Computer

January 20, 2025Niclas Schillo, Andreas SturmQuantum ComputingComputers, Differential equations, Encoding, Hardware, Logic gates, Noise measurement, Quantum algorithm, Quantum cascade lasers, Quantum circuit, Qubit

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 […]

Benchmarking Quantum Circuit Transformation With QKNOB Circuits

January 8, 2025Sanjiang Li, Xiangzhen Zhou, Yuan FengQuantum SoftwareApproximation algorithms, Benchmark testing, Costs, Logic gates, Performance evaluation, Quantum circuit, Quantum mechanics, Qubit, Scalability, Transforms

Current superconducting quantum devices impose strict connectivity constraints on quantum circuit execution, necessitating circuit transformation before executing quantum circuits on physical hardware. Numerous quantum circuit transformation (QCT) algorithms have been proposed. To enable faithful evaluation of state-of-the-art QCT algorithms, this article introduces qubit mapping benchmark with known near-optimality (QKNOB), a novel benchmark construction method for […]

RSFQ All-Digital Programmable Multitone Generator for Quantum Applications

December 20, 2024João Barbosa, Jack C. Brennan, Alessandro Casaburi, M. D. Hutchings, Alex Kirichenko, Oleg Mukhanov, Martin WeidesEnabling TechnologiesComb filters, Computer architecture, Delays, Generators, Photon detectors, Quantum circuit, Qubit, Scalability, Shift registers, Standards

One of the most important and topical challenges of quantum circuits is their scalability. Rapid single flux quantum (RSFQ) technology is at the forefront of replacing current standard CMOS-based control architectures for a number of applications, including quantum computing and quantum sensor arrays. By condensing the control and readout to single-flux-quantum-based on-chip devices that are […]

Dissipative Variational Quantum Algorithms for Gibbs State Preparation

December 4, 2024Yigal Ilin, Itai AradQuantum ComputingCost function, Hardware, Logic gates, Noise, Quantum algorithm, Quantum circuit, Quantum computing, Qubit, Resilience, Toy manufacturing industry

In recent years, variational quantum algorithms have gained significant attention due to their adaptability and efficiency on near-term quantum hardware. They have shown potential in a variety of tasks, including linear algebra, search problems, Gibbs, and ground state preparation. Nevertheless, the presence of noise in current day quantum hardware severely limits their performance. In this […]

BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures

July 17, 2024Nikiforos Paraskevopoulos, Carmen G. Almudever, Sebastian FeldQuantum ComputingComputer architecture, Logic gates, Quantum circuit, Qubit, Routing, Task analysis, Topology

As quantum computing devices increase in size with respect to the number of qubits, two-qubit interactions become more challenging, necessitating innovative and scalable qubit routing solutions. In this work, we introduce beSnake, a novel algorithm specifically designed to address the intricate qubit routing challenges in scalable spin-qubit architectures. Unlike traditional methods in superconducting architectures that […]

On Quantum Natural Policy Gradients

June 24, 2024André Sequeira, Luis Paulo Santos, Luis Soares Barbosa,Regular, UncategorizedBasic Conditions, Deep Reinforcement Learning, Estimation Error, Expected Value, Fisher Information, Fisher Information Matrix, Gradient Ascent, Gradient Update, Infidelity, Less Than Or Equal, Markov Decision Process, Matrix Inequalities, Natural Gradient, Normal Vector, Optimal Policy, Policy Gradient, Policy Gradient Method, Policy Parameters, Policy Space, Positive Semidefinite Matrix, Preconditioning, Projector, Proximal Policy Optimization, Quantum circuit, Quantum Measurement, Quantum state, Reward Function, Square Root, Standard Gradient, State Space

This article delves into the role of the quantum Fisher information matrix (FIM) in enhancing the performance of parameterized quantum circuit (PQC)-based reinforcement learning agents. While previous studies have highlighted the effectiveness of PQC-based policies preconditioned with the quantum FIM in contextual bandits, its impact in broader reinforcement learning contexts, such as Markov decision processes, […]