Machine learning (ML) classification tasks can be carried out on a quantum computer (QC) using probabilistic quantum memory (PQM) and its extension, parametric PQM (P-PQM), by calculating the Hamming distance between an input pattern and a database of r patterns containing z features with a distinct attributes. For PQM and P-PQM to correctly compute the Hamming distance, the feature must be […]
In this article, we demonstrate that, by employing the OpenPulse design kit for IBM superconducting quantum devices, the controlled-V gate ( cv gate) can be implemented in about half the gate time to the controlled-X gate ( cx or cnot gate) and consequently 65.5% reduced gate time compared to the cx -based implementation of cv […]
Quantum error correction (QEC) is required in quantum computers to mitigate the effect of errors on physical qubits. When adopting a QEC scheme based on surface codes, error decoding is the most computationally expensive task in the classical electronic back-end. Decoders employing neural networks (NN) are well-suited for this task but their hardware implementation has […]
We present a divide-and-conquer approach to deterministically prepare Dicke states |Dnk⟩ (i.e., equal-weight superpositions of all n -qubit states with Hamming weight k ) on quantum computers. In an experimental evaluation for up to n=6 qubits on IBM Quantum Sydney and Montreal devices, we achieve significantly higher state fidelity compared to previous results. The fidelity gains are achieved through several techniques: our circuits […]
The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of […]
Quantum volume (QV) has become the de-facto standard benchmark to quantify the capability of noisy intermediate-scale quantum (NISQ) devices. While QV values are often reported by NISQ providers for their systems, we perform our own series of QV calculations on 24 NISQ devices currently offered by IBM Q, IonQ, Rigetti, Oxford Quantum Circuits, and Quantinuum […]
Currently available quantum computers are prone to errors. Circuit optimization and error mitigation methods are needed to design quantum circuits to achieve better fidelity when executed on NISQ hardware. Dynamical decoupling (DD) is generally used to suppress the decoherence error, and different DD strategies have been proposed. Moreover, the circuit fidelity can be improved by […]
The well-known 3-bit Hermitian gate (a Toffoli gate) has been implemented using Clifford+T circuits. Compared with the Peres gate, its implementation circuit requires more controlled- not (cnot) gates. However, the Peres gate is not Hermitian. This article reports four 3-bit Hermitian gates named LI gates, whose realized circuits have the same T-count, T-depth, and cnot […]
Operating semiconductor quantum dots as quantum bits requires isolating single electrons by adjusting gate voltages. The transitions of electrons to and from the dots appear as a honeycomb-like pattern in recorded charge stability diagrams (CSDs). Thus, detecting the pattern is essential to tune a double dot, but manual tuning is seriously time-consuming. However, automation of […]
Most of the architectural research on photonic implementations of measurement-based quantum computing (MBQC) has focused on the quantum resources involved in the problem with the implicit assumption that these will provide the main constraints on system scaling. However, the “flying-qubit” architecture of photonic MBQC requires specific timing constraints that need to be met by the […]