Logic gates Archives - IEEE Transactions on Quantum Engineering

A Proposed Quantum Framework for Low-Complexity Quantum Simulation and Spectrum Estimation of Hankel-Patterned Systems

November 1, 2023Mostafizur Rahaman LaskarEnabling TechnologiesComputer architecture, Logic gates, Matrix decomposition, Signal processing, Signal processing algorithms, Sparse matrices, Symmetric matrices

The structured matrix completion problem (SMCP) is ubiquitous in several signal processing applications. In this article, we consider a fixed pattern, namely, the Hankel-structure for the SMCP under quantum formalism. By exploiting its structure, a lower-gate-complexity quantum circuit realization of a Hankel system is demonstrated. Further, we propose a quantum simulation algorithm for the Hankel-structured […]

Optimal Control of the Operating Regime of a Single-Electron Double Quantum Dot

October 16, 2023V. ReiherQuantum ComputingLogic gates, Magnetic fields, Optimal control, Pipelines, Quantum dots, Qubit, Silicon

The double-quantum-dot device benefits from the advantages of both the spin and charge qubits, while offering ways to mitigate their drawbacks. Careful gate voltage modulation can grant greater spinlike or chargelike dynamics to the device, yielding long coherence times with the former and high electrical susceptibility with the latter for electrically driven spin rotations or […]

Emulation of Quantum Algorithms Using CMOS Analog Circuits

September 27, 2023Sharan MouryaQuantum ComputingAnalog circuits, Emulation, Field programmable gate arrays, Hardware, Logic gates, Quantum computing, Qubit

Quantum computers are regarded as the future of computing, as they are believed to be capable of solving extremely complex problems that are intractable on conventional digital computers. However, near-term quantum computers are prone to a plethora of noise sources that are difficult to mitigate, possibly limiting their scalability and precluding us from running any […]

Shor’s Algorithm Using Efficient Approximate Quantum Fourier Transform

September 25, 2023Kento OonishiQuantum ComputingApproximation algorithms, Computational efficiency, Fault tolerance, Fault tolerant systems, Fourier transforms, Logic gates, Qubit

Shor’s algorithm solves the integer factoring and discrete logarithm problems in polynomial time. Therefore, the evaluation of Shor’s algorithm is essential for evaluating the security of currently used public-key cryptosystems because the integer factoring and discrete logarithm problems are crucial for the security of these cryptosystems. In this article, a new approximate quantum Fourier transform […]

Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem

August 18, 2023Yuki SanoQuantum ComputingEncoding, Genetic algorithms, Linear programming, Logic gates, Optimization, Quantum circuit, Qubit

In this article, we propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic speedup for solving the problem. The conventional method relies on a one-hot encoding of the channel indices, resulting in a […]

Testing Platform-Independent Quantum Error Mitigation on Noisy Quantum Computers

August 15, 2023Vincent RussoQuantum ComputingBenchmark testing, Computers, Logic gates, Noise measurement, Quantum computing, Qubit, Superconducting devices

We apply quantum error mitigation (QEM) techniques to a variety of benchmark problems and quantum computers to evaluate the performance of QEM in practice. To do so, we define an empirically motivated, resource-normalized metric of the improvement of error mitigation, which we call the improvement factor, and calculate this metric for each experiment we perform. […]

A Modular Quantum Compilation Framework for Distributed Quantum Computing

August 10, 2023Davide FerrariQuantum Computer ArchitectureComputer architecture, Logic gates, Network topology, Program processors, Quantum circuit, Quantum computing, Qubit

For most practical applications, quantum algorithms require large resources in terms of qubit number, much larger than those available with current noisy intermediate-scale quantum processors. With the network and communication functionalities provided by the quantum Internet, distributed quantum computing (DQC) is considered as a scalable approach for increasing the number of available qubits for computational […]

Machine-Learning-Based Qubit Allocation for Error Reduction in Quantum Circuits

August 4, 2023Travis LeCompteQuantum Computing, UncategorizedIntegrated circuit reliability, Layout, Logic gates, Qubit, Reliability, Resource management, Routing

Quantum computing is a quickly growing field with great potential for future technology. Quantum computers in the current noisy intermediate-scale quantum (NISQ) era face two major limitations:1) qubit count and 2) error vulnerability. Although quantum error correction methods exist, they are not applicable to the current size of computers, requiring thousands of qubits, while current […]

Enabling Efficient Real-Time Calibration on Cloud Quantum Machines

June 14, 2023Yiding LiuQuantum ComputingCalibration, Logic gates, Noise measurement, Quantum computing, Qubit, Reliability, Task analysis

Noisy intermediate-scale quantum computers are widely used for quantum computing (QC) from quantum cloud providers. Among them, superconducting quantum computers, with their high scalability and mature processing technology based on traditional silicon-based chips, have become the preferred solution for most commercial companies and research institutions to develop QC. However, superconducting quantum computers suffer from fluctuation […]

Quantum Topology Optimization via Quantum Annealing

June 14, 2023Zisheng YeQuantum ComputingAnnealing, Computational efficiency, Layout, Linear programming, Logic gates, Optimization, Quantum annealing

We present a quantum annealing-based solution method for topology optimization (TO). In particular, we consider TO in a more general setting, i.e., applied to structures of continuum domains where designs are represented as distributed functions, referred to as continuum TO problems. According to the problem’s properties and structure, we formulate appropriate subproblems that can be […]