Logic gates Archives - IEEE Transactions on Quantum Engineering

Design and Analysis of Digital Communication Within an SoC-Based Control System for Trapped-Ion Quantum Computing

March 31, 2023Nafis IrtijaEnabling TechnologiesControl systems, Hardware, Logic gates, Quantum computing, Qubit, Radio frequency, Throughput

Large-scale quantum information processing requires the use of quantum error-correcting codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates, as they can be implemented using only local interactions in a 2-D array of physical qubits. Procedures, such as defect braiding and lattice surgery, can […]

Hardness of Braided Quantum Circuit Optimization in the Surface Code

March 30, 2023Kunihiro WasaQuantum ComputingFault tolerance, Fault tolerant systems, Lattices, Logic gates, Optimization, Quantum circuit, Qubit

Pauli Error Propagation-Based Gate Rescheduling for Quantum Circuit Error Mitigation

November 2, 2022Vedika SaravananOpen Access, Quantum SoftwareComputers, Error analysis, Logic gates, Noise measurement, Quantum circuit, Quantum computing, Qubit

Noisy intermediate-scale quantum algorithms, which run on noisy quantum computers, should be carefully designed to boost the output state fidelity. While several compilation approaches have been proposed to minimize circuit errors, they often omit the detailed circuit structure information that does not affect the circuit depth or the gate count. In the presence of spatial […]

Depth Optimization of CZ, CNOT, and Clifford Circuits

November 2, 2022Dmitri MaslovOpen Access, Quantum SoftwareColor, Costs, Ions, Logic gates, Quantum circuit, Qubit, Upper bound

We seek to develop better upper bound guarantees on the depth of quantum CZ gate, cnot gate, and Clifford circuits than those reported previously. We focus on the number of qubits n≤ 1 345 000 (de Brugière et al. , 2021), which represents the most practical use case. Our upper bound on the depth of CZ circuits is ⌊n/2+0.4993⋅log2(n)+3.0191⋅log(n)−10.9139⌋ , improving the best-known […]

Mutation Testing of Quantum Programs: A Case Study With Qiskit

November 2, 2022Daniel FortunatoOpen Access, Quantum SoftwareBuildings, Codes, Computers, Logic gates, Quantum computing, Qubit, Software testing

As quantum computing is still in its infancy, there is an inherent lack of knowledge and technology to test a quantum program properly. In the classical realm, mutation testing has been successfully used to evaluate how well a program’s test suite detects seeded faults (i.e., mutants). In this article, building on the definition of syntactically […]

A Software Development Kit and Translation Layer for Executing Intel 8080 Assembler on a Quantum Computer (August 2022)

November 2, 2022James FitzjohnOpen Access, Quantum SoftwareCentral Processing Unit, Codes, Emulation, Logic gates, Quantum circuit, Quantum computing, Random access memory

One of the major obstacles to the adoption of quantum computing is the requirement to define quantum circuits at the quantum gate level. Many programmers are familiar with high-level or low-level programming languages but not quantum gates nor the low-level quantum logic required to derive useful results from quantum computers. The steep learning curve involved […]

Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-Phase Toffoli Gates

November 2, 2022Kento OonishiOpen Access, Quantum ComputingAdders, Computers, Costs, Logic gates, Optimization, Quantum computing, Qubit

Control modular addition is a core arithmetic function, and we must consider the computational cost for actual quantum computers to realize efficient implementation. To achieve a low computational cost in a control modular adder, we focus on minimizingKQ (where K is the number of logical qubits required by the algorithm, and Q is the elementary […]

Efficient Quantum State Preparation for the Cauchy Distribution Based on Piecewise Arithmetic

November 2, 2022Ethan T. WangOpen Access, Quantum ComputingApproximation algorithms, Distribution functions, Logic gates, Mathematical models, Monte Carlo methods, Qubit, Registers

The benefits of the quantum Monte Carlo algorithm heavily rely on the efficiency of the superposition state preparation. So far, most reported Monte Carlo algorithms use the Grover–Rudolph state preparation method, which is suitable for efficiently integrable distribution functions. Consequently, most reported works are based on log-concave distributions, such as normal distributions. However, non-log-concave distributions […]

Grover on KATAN: Quantum Resource Estimation

November 2, 2022Mostafizar RahmanOpen Access, Quantum ComputingCiphers, Cryptography, Estimation, Logic gates, NIST, Quantum circuit, Scheduling algorithms

This article presents the cost analysis of mounting Grover’s key search attack on the family of KATAN block cipher. Several designs of the reversible quantum circuit of KATAN are proposed. Owing to the National Insitute of Standards and Technology’s (NIST) proposal for postquantum cryptography standardization, the circuits are designed focusing on minimizing the overall depth. […]

A Grover Search-Based Algorithm for the List Coloring Problem

November 2, 2022Sayan MukherjeeOpen Access, Quantum ComputingColor, Logic gates, Quantum algorithm, Qubit, Registers, Search problems, Standards

Graph coloring is a computationally difficult problem, and currently the best known classical algorithm for k -coloring of graphs on n vertices has runtimes Ω(2n) for k≥5 . The list coloring problem asks the following more general question: given a list of available colors for each vertex in a graph, does it admit a proper coloring? We propose a hybrid classical-quantum algorithm based […]