arXiv subjects

Tamiya Onodera

Publications and source records attributed to Tamiya Onodera.

11 recordsLinked to original sources

arXiv2026

Efficient Quantum Circuits for Electronic Hamiltonian Simulation without Pauli Expansion

Electronic Hamiltonian simulation is commonly formulated by mapping fermionic operators to qubit operators and subsequently expanding the resulting ladder-operator products into Pauli strings. While general, this procedure obscures the higher-level fermionic structure and can hide opportunities for circuit optimization. Building on ladder-string-pair (Lasp) diagonalization originally developed for Hamiltonian simulation of partial differential equations, we construct time-evolution circuits for the second-quantized electronic Hamiltonian without performing a Pauli expansion. For the most general case of complex-valued coefficients, we present a time-evolution circuit for a two-body fermionic Lasp operator that corresponds to 16 Pauli strings in the Pauli-expansion approach but does not suffer from Trotter error at this stage. Expanding the optimization scope from a single operator to a triad of three fermionic Lasp operators sharing the same four spin-orbital indices enables systematic cancellation of CX gates, reducing the CX-gate count from 36 to 12 in the example considered, still without introducing Trotter error at this stage. For $n$ spin orbitals, further expanding the optimization scope to a sequence of $O(n)$ suitably ordered triads enables a cascade of CX-gate reductions across triad boundaries, reducing the CX-gate count from $O(n^2)$ to $O(n)$. The Lasp-based approach also naturally accommodates controlled time evolution and yields further optimizations for real-valued Hamiltonians. These results demonstrate that the Lasp-based approach enables more efficient time-evolution circuits by preserving high-level circuit structures and thereby expanding the scope of optimization, providing a systematic route toward more efficient electronic Hamiltonian simulation.

quant-ph↗

arXiv2025

Multilevel Circuit Optimization in Quantum Compilers: A Case Study

In this paper, we explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit. At each level, we first perform an appropriate set of circuit simplifications and then lower the simplified circuit into the next level, decomposing the gates not supported there. We demonstrate its effectiveness, using as a case study the source circuit for Hamiltonian simulation to solve a partial differential equation, which is densely populated with multi-controlled gates and is transformed by the state-of-the-art circuit compiler to the target circuit with the quadratic number of CX gates in the number of qubits. MLCO makes visible higher-level circuit structures, providing us with insights about how to simplify the circuits and how to decompose the gates. By putting the right circuit structure in place and selecting the right decomposition algorithm, we could cause massive cancellation of entangling gates, thereby having achieved the quadratic reduction in the number of CX gates.

quant-ph↗

arXiv2024

Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits

Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a potential and promising approach to achieve this purpose. Actually, there are several oracle-based Hamiltonian simulations with potential quantum speedup, but their detailed implementations and accordingly the detailed computational complexities are all unclear. This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation; the key technique is the explicit gate construction of differential operators contained in the target partial differential equation discretized by the finite difference method. Moreover, we show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms. We also provide numerical experiments and an experiment on a real device for the wave equation to demonstrate the validity of our proposed method.

quant-ph↗

arXiv2024

Qudit-Generalization of the Qubit Echo and Its Application to a Qutrit-Based Toffoli Gate

The fidelity of certain gates on noisy quantum computers may be improved when they are implemented using more than two levels of the involved transmons. The main impediments to achieving this potential are the dynamic gate phase errors that cannot be corrected via calibration. The standard tool for countering such phase errors in two-level qubits is the echo protocol, often referred to as the dynamical decoupling sequence, where the evolution of a qubit is punctuated by an even number of X gates. We introduce basis cycling, which is a direct generalization of the qubit echo to general qudits, and provide an analytic framework for designing gate sequences to produce desired effects using this technique. We then apply basis cycling to a Toffoli gate decomposition incorporating a qutrit and obtain CCZ gate fidelity values up to 93.8$\pm$0.1%, measured by quantum process tomography, on IBM quantum computers. The gate fidelity remains stable without recalibration even while the resonant frequency of the qutrit fluctuates, highlighting the dynamical nature of phase error cancellation through basis cycling. Our results demonstrate that one of the biggest difficulties in implementing qudit-based gate decompositions on superconducting quantum computers can be systematically overcome when certain conditions are met, and thus open a path toward fulfilling the promise of qudits as circuit optimization agents.

quant-ph↗

arXiv2024

Approximate complex amplitude encoding algorithm and its application to data classification problems

Quantum computing has a potential to accelerate the 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 parameterized 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 give a numerical experiment showing that it enables classification of Iris dataset and credit card fraud detection.

quant-ph↗

arXiv2023

Quantum data learning for quantum simulations in high-energy physics

Quantum machine learning with parametrised quantum circuits has attracted significant attention over the past years as an early application for the era of noisy quantum processors. However, the possibility of achieving concrete advantages over classical counterparts in practical learning tasks is yet to be demonstrated. A promising avenue to explore potential advantages is the learning of data generated by quantum mechanical systems and presented in an inherently quantum mechanical form. In this article, we explore the applicability of quantum-data learning to practical problems in high-energy physics, aiming to identify domain specific use-cases where quantum models can be employed. We consider quantum states governed by one-dimensional lattice gauge theories and a phenomenological quantum field theory in particle physics, generated by digital quantum simulations or variational methods to approximate target states. We make use of an ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states in the Schwinger model, (de)confinement phases from time-evolved states in the $\mathbb{Z}_2$ gauge theory, and that it can extract fermion flavor/coupling constants in a quantum simulation of parton shower. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.

quant-ph↗

arXiv2022

Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator

Efficient methods for loading given classical data into quantum circuits are essential for various quantum algorithms. In this paper, we propose an algorithm called Approximate Amplitude Encoding that can effectively load all the components of a given real-valued data vector into the amplitude of quantum state, while the previous proposal can only load the absolute values of those components. The key of our algorithm is to variationally train a shallow parameterized quantum circuit, using the results of two types of measurement; the standard computational-basis measurement plus the measurement in the Hadamard-transformed basis, introduced in order to handle the sign of the data components. The variational algorithm changes the circuit parameters so as to minimize the sum of two costs corresponding to those two measurement basis, both of which are given by the efficiently-computable maximum mean discrepancy. We also consider the problem of constructing the singular value decomposition entropy via the stock market dataset to give a financial market indicator; a quantum algorithm (the variational singular value decomposition algorithm) is known to produce a solution faster than classical, which yet requires the sign-dependent amplitude encoding. We demonstrate, with an in-depth numerical analysis, that our algorithm realizes loading of time-series of real stock prices on quantum state with small approximation error, and thereby it enables constructing an indicator of the financial market based on the stock prices.

quant-ph↗

arXiv2022

Noisy quantum amplitude estimation without noise estimation

Many quantum algorithms contain an important subroutine, the quantum amplitude estimation. As the name implies, this is essentially the parameter estimation problem and thus can be handled via the established statistical estimation theory. However, this problem has an intrinsic difficulty that the system, i.e., the real quantum computing device, inevitably introduces unknown noise; the probability distribution model then has to incorporate many nuisance noise parameters, resulting that the construction of an optimal estimator becomes inefficient and difficult. For this problem, we apply the theory of nuisance parameters (more specifically, the parameter orthogonalization method) to precisely compute the maximum likelihood estimator for only the target amplitude parameter, by removing the other nuisance noise parameters. That is, we can estimate the amplitude parameter without estimating the noise parameters. We validate the parameter orthogonalization method in a numerical simulation and study the performance of the estimator in the experiment using a real superconducting quantum device.

quant-ph↗

arXiv2021

Amplitude estimation via maximum likelihood on noisy quantum computer

Recently we find several candidates of quantum algorithms that may be implementable in near-term devices for estimating the amplitude of a given quantum state, which is a core sub- routine in various computing tasks such as the Monte Carlo methods. One of those algorithms is based on the maximum likelihood estimate with parallelized quantum circuits. In this paper, we extend this method so that it incorporates the realistic noise effect, and then give an experimental demonstration on a superconducting IBM Quantum device. The maximum likelihood estimator is constructed based on the model assuming the depolarization noise. We then formulate the problem as a two-parameters estimation problem with respect to the target amplitude parameter and the noise parameter. In particular we show that there exist anomalous target values, where the Fisher information matrix becomes degenerate and consequently the estimation error cannot be improved even by increasing the number of amplitude amplifications. The experimental demonstration shows that the proposed maximum likelihood estimator achieves quantum speedup in the number of queries, though the estimation error saturates due to the noise. This saturated value of estimation error is consistent to the theory, which implies the validity of the depolarization noise model and thereby enables us to predict the basic requirement on the hardware components (particularly the gate error) in quantum computers to realize the quantum speedup in the amplitude estimation task.

quant-ph↗

arXiv2021

Modified Grover operator for amplitude estimation

In this paper, we propose a quantum amplitude estimation method that uses a modified Grover operator and quadratically improves the estimation accuracy in the ideal case, as in the conventional one using the standard Grover operator. Under the depolarizing noise, the proposed method can outperform the conventional one in the sense that it can in principle achieve the ultimate estimation accuracy characterized by the quantum Fisher information in the limit of a large number of qubits, while the conventional one cannot achieve the same value of ultimate accuracy. In general this superiority requires a sophisticated adaptive measurement, but we numerically demonstrate that the proposed method can outperform the conventional one and approach to the ultimate accuracy, even with a simple non-adaptive measurement strategy.

quant-ph↗

arXiv2020

Amplitude estimation without phase estimation

This paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which consists of many controlled amplification operations followed by a quantum Fourier transform. However, the whole procedure is hard to implement with current and near-term quantum computers. In this paper, we propose a quantum amplitude estimation algorithm without the use of expensive controlled operations; the key idea is to utilize the maximum likelihood estimation based on the combined measurement data produced from quantum circuits with different numbers of amplitude amplification operations. Numerical simulations we conducted demonstrate that our algorithm asymptotically achieves nearly the optimal quantum speedup with a reasonable circuit length.

quant-ph↗