Yasuhiro Ohkura, Author at IEEE Transactions on Quantum Engineering

Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems

November 2, 2022Yasuhiro OhkuraOpen Access, Quantum SoftwareCloud computing, Crosstalk, Program processors, Quantum circuit, Quantum computing, Qubit, Throughput

In the noisy intermediate-scale quantum (NISQ) era, the idea of quantum multiprogramming , running multiple quantum circuits (QCs) simultaneously on the same hardware, helps to improve the throughput of quantum computation. However, the crosstalk, unwanted interference between qubits on NISQ processors, may cause performance degradation when using multiprogramming. To address this challenge, we introduce palloq […]

Quantum Kernels for Real-World Predictions Based on Electronic Health Records

November 2, 2022Zoran KrunicOpen Access, Quantum SoftwareKernel, Licenses, Machine learning, Measurement, Quantum computing, Support vector machines, Training

Research on near-term quantum machine learning has explored how classical machine learning algorithms endowed with access to quantum kernels (similarity measures) can outperform their purely classical counterparts. Although theoretical work has shown a provable advantage on synthetic data sets, no work done to date has studied empirically whether the quantum advantage is attainable and with […]

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

Teaching Quantum Computing to High-School-Aged Youth: A Hands-On Approach

November 2, 2022Prashanti Priya AngaraOpen Access, Quantum ComputingConferences, Industries, Programming profession, Quantum computing, Quantum mechanics, Qubit, Software

Quantum computing is aninterdisciplinary field that lies at the intersection of mathematics, quantum physics, and computer science, and finds applications in areas including optimization, machine learning, and simulation of chemical, physical, and biological systems. It has the potential to help solve problems that so far have no satisfying method solving them, and to provide significant […]

Pricing Multi-Asset Derivatives by Finite-Difference Method on a Quantum Computer

November 2, 2022Koichi MiyamotoOpen Access, Quantum ComputingComplexity theory, Europe, Frequency division multiplexing, Handheld computers, Pricing, Quantum algorithm, Time complexity

Following the recent great advance of quantum computing technology, there are growing interests in its applications to industries, including finance. In this article, we focus on derivative pricing based on solving the Black–Scholes partial differential equation by the finite-difference method (FDM), which is a suitable approach for some types of derivatives but suffers from the […]

Hash Function Based on Controlled Alternate Quantum Walks With Memory (September 2021)

November 2, 2022Qing ZhouOpen Access, Quantum ComputingHash functions, Process control, Quantum computing, Quantum mechanics, Resistance, Sensitivity, Transforms

We propose a Quantum inspired Hash Function using controlled alternate quantum walks with Memory on cycles (QHFM), where the j th message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at the j th time step, and the hash value is calculated from the resulting probability distribution of the […]

Quantum Radon Transforms and Their Applications

November 2, 2022Guangsheng MaOpen Access, Quantum ComputingHandheld computers, Image processing, Image reconstruction, Noise reduction, Quantum algorithm, Quantum computing, Transforms

This article extends the Radon transform, a classical image-processing tool for fast tomography and denoising, to the quantum computing platform. A new kind of periodic discrete Radon transform (PDRT), called the quantum periodic discrete Radon transform (QPRT), is proposed. The quantum implementation of QPRT based on the amplitude encoding method is exponentially faster than the […]

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