Rudy Raymond

Rudy Raymond


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 July 2022 in Physical Review A
Verified
Journal Article
Open access
PDF file
BYBo Yang
Bo Yang
Rudy RaymondRudy Raymond
Rudy Raymond
SUShumpei Uno
Shumpei Uno
The readout error on near-term quantum devices is one of the dominant noise factors, which can be mitigated by classical postprocessing called quantum readout error mitigation (QREM). The standard QREM applies the inverse of noise calibration matrix to the outcome probability distribution using exponential computational resources to the number of measured qubits. This becomes infeasible for the current quantum devices with tens of qubits or more. Here we propose two efficient QREM methods finishing in O(ns2) time for probability distributions of n qubits and s shots, which mainly aim at mitigating sparse probability distributions such that only a few states are dominant. We compare the proposed methods with several recent QREM methods in the following three cases: expectation values of the GHZ state, its fidelities, and the estimation error of maximum likelihood amplitude estimation (MLAE) algorithm with a modified Grover iterator. The two cases of the GHZ state are on real IBM quantum devices, while the third is with numerical simulation. Using the proposed method, the mitigation of the 65-qubit GHZ state takes only a few seconds, and we witness the fidelity of the 29-qubit GHZ state exceeding 0.5. The proposed methods also succeed in reducing the estimation error in the MLAE algorithm, outperforming the results by other QREM methods in general.

10 August 2021 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
HYHiroshi Yano
Hiroshi Yano
YSYudai Suzuki
Yudai Suzuki
KIKohei M. Itoh
Kohei M. Itoh
Rudy RaymondRudy Raymond
Rudy Raymond
NYNaoki Yamamoto
Naoki Yamamoto
Recent days have witnessed significant interests in applying quantum-enhanced techniques for solving a variety of machine learning tasks. Variational methods that use quantum resources of imperfect quantum devices with the help of classical computing techniques are popular for supervised learning. Variational quantum classification (VQC) is one of such methods with possible quantum advantage in using quantum-enhanced features that are hard to compute by classical methods. Its performance depends on the mapping of classical features into a quantum-enhanced feature space. Although there have been many quantum-mapping functions proposed so far, there is little discussion on efficient mapping of discrete features, such as age group, zip code, and others, which are often significant for classifying datasets of interest. We first introduce the use of quantum random-access coding (QRAC) to map such discrete features efficiently into limited number of qubits for VQC. In numerical simulations, we present a range of encoding strategies and demonstrate their limitations and capabilities. We experimentally show that QRAC can help speeding up the training of VQC by reducing its parameters via saving on the number of qubits for the mapping. We confirm the effectiveness of the QRAC in VQC by experimenting on classification of real-world datasets with both simulators and real quantum devices.

13 June 2022 in Physical Review A
Verified
Journal Article
Open access
PDF file
KWKaito Wada
Kaito Wada
Rudy RaymondRudy Raymond
Rudy Raymond
YOYu-Ya Ohnishi
Yu-Ya Ohnishi
EKEriko Kaminishi
Eriko Kaminishi
MSMichihiko Sugawara
Michihiko Sugawara
HWHiroshi Watanabe
Hiroshi Watanabe
We propose a method to sequentially optimize arbitrary single-qubit gates in parametrized quantum circuits for simulating real- and imaginary-time evolution. The method utilizes full degrees of freedom of single-qubit gates and therefore can potentially obtain better performance. Specifically, it simultaneously optimizes both the axis and the angle of a single-qubit gate, while the known methods either optimize the angle with the axis fixed, or vice versa. It generalizes the known methods and utilizes sinusoidal cost functions parametrized by the axis and angle of rotation. Furthermore, we demonstrate how it can be extended to optimize a set of parametrized two-qubit gates with excitation-conservation constraints, which includes the HOP and the reconfigurable beam-splitter gates. We perform numerical experiments showing the power of the proposed method to find ground states of typical Hamiltonians with quantum imaginary-time evolution using parametrized quantum circuits. In addition, we show the method can be applied to real-time evolution and discuss the tradeoff between its simulation accuracy and hardware efficiency.

13 May 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
NMNaoki Mitsuda
Naoki Mitsuda
TITatsuhiro Ichimura
Tatsuhiro Ichimura
KNKouhei Nakaji
Kouhei Nakaji
YSYohichi Suzuki
Yohichi Suzuki
TTTomoki Tanaka
Tomoki Tanaka
NYNaoki Yamamoto
Naoki Yamamoto
Quantum computing has a potential to accelerate data processing efficiency, especially in machine learning, by exploiting special features such as the quantum interference. The major challenge in this application is that, in general, the task of loading a classical data vector into a quantum state requires an exponential number of quantum gates. The approximate amplitude encoding (AAE) method, which uses a variational means to approximately load a given real-valued data vector into the amplitude of a quantum state, was recently proposed as a general approach to this problem mainly for near-term devices. However, AAE cannot load a complex-valued data vector, which narrows its application range. In this work, we extend AAE so that it can handle a complex-valued data vector. The key idea is to employ the fidelity distance as a cost function for optimizing a parametrized quantum circuit, where the classical shadow technique is used to efficiently estimate the fidelity and its gradient. We apply this algorithm to realize the complex-valued-kernel binary classifier called the compact Hadamard classifier, and then we present a numerical experiment showing that it enables classification of the Iris dataset and credit card fraud detection.

25 August 2022 in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
Verified
Journal Article
Open access
BYBo Yang
Bo Yang
Rudy RaymondRudy Raymond
Rudy Raymond
HIHiroshi Imai
Hiroshi Imai
HCHyungseok Chang
Hyungseok Chang
HHHidefumi Hiraishi
Hidefumi Hiraishi
Testing and verifying imperfect multi-qubit quantum devices are important as such noisy quantum devices are widely available today. Bell inequalities are known to be useful for testing and verifying the quality of the quantum devices from their nonlocal quantum states and local measurements. There have been many experiments demonstrating the violations of Bell inequalities, but they are limited in the number of qubits and the types of quantum states. We report violations of Bell inequalities on IBM Quantum devices based on the scalable and robust inequalities maximally violated by graph states as proposed by Baccari et al. (Ref. [1]). The violations are obtained from the quantum states of path graphs up to 57 and 21 qubits on a 65-qubit and two 27-qubit IBM Quantum devices, respectively, and from those of star graphs up to 11 qubits with quantum readout error mitigation (QREM). We are able to show violations of the inequalities on various graph states by constructing low-depth quantum circuits and by applying the QREM technique. We also point out that quantum circuits for star graph states of size N can be realized with circuits of depth O(√N) on subdivided honeycomb lattices which are the topology of the 65-qubit IBM Quantum device. Our experiments show encouraging results on the ability of existing quantum devices to prepare entangled quantum states and provide experimental evidence on the benefit of scalable Bell inequalities for testing them.

10 March 2023 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
DHDylan Herman
Dylan Herman
Rudy RaymondRudy Raymond
Rudy Raymond
MLMuyuan Li
Muyuan Li
NRNicolas Robles
Nicolas Robles
AMAntonio Mezzacapo
Antonio Mezzacapo
MPMarco Pistoia
Marco Pistoia
Categorical data plays an important part in machine learning research and appears in a variety of applications. Models that can express large classes of real-valued functions on the Boolean cube are useful for problems involving discrete-valued data types, including those which are not Boolean. To this date, the commonly used schemes for embedding classical data into variational quantum machine learning models encode continuous values. Here we investigate quantum embeddings for encoding Boolean-valued data into parameterized quantum circuits used for machine learning tasks. We narrow down representability conditions for functions on the n -dimensional Boolean cube with respect to previously known results, using two quantum embeddings: a phase embedding and an embedding based on quantum random access codes. We show that for any real-valued function on the n -dimensional Boolean cube, there exists a variational linear quantum model based on a phase embedding using n qubits that can represent it and an ensemble of such models using $d \lt n$ qubits that can express any function with degree at most d. Additionally, we prove that variational linear quantum models that use the quantum random access code embedding can express functions on the Boolean cube with degree $d \leq \lceil \frac{n}{3}\rceil$ using $\lceil \frac{n}{3}\rceil$ qubits, and that an ensemble of such models can represent any function on the Boolean cube with degree $d \leq \lceil \frac{n}{3}\rceil$ . Furthermore, we discuss the potential benefits of each embedding and the impact of serial repetitions. Lastly, we demonstrate the use of the embeddings presented by performing numerical simulations and experiments on IBM quantum processors using the Qiskit machine learning framework.