Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Understanding qubit trajectories in parametrized quantum circuits

Seungcheol Oh, Chaemoon Im, Soohyun Park, Joongheon Kim

Published Dec 29, 2025• 2 citations
Publisher
DOI
10.1103/1x3t-9kzq

Related papers

Effect of information component of inaccurate continuous measurements of signal characteristics qubit-detectors with parametric transformation of energy

Sergiy Melnyk, Н. И. Слипченко, V. I. Shnyrkov

The model of an inaccurate continuous measurement of parametric energy conversion in the charge-phase qubit-detector of Rabi oscillation modes is presented. Apart from the inductive interaction of the qubit, the measuring circuit allows for the effect of continuous partial collapse of the qubit state with its inaccurate measurement. The present article considers the case of practically pure continuous inaccurate measurement of the signal qubit detector characteristics operating in a parametric energy conversion mode. To describe it we have used a previously developed [3] information approach to characterizing the dynamics of the afore-mentioned type of measurement based upon the the quantum Bayes theorem. We have also proposed a principle of invariance for a classical trajectory of the detector in the course of the continuous inaccurate measurement in relation to the mode of qubit quantomechanic description [4].

International Crimean Conference Microwave and Telecommunication Technology•Jan 1, 2012•0 citations

Proposal of Quantum Circuits and Qubit Mapping Optimization

賢太 海老澤, 1477, Kenta Ebisawa

•Oct 1, 2025•0 citations

Quantum machine learning beyond kernel methods

Sofiène Jerbi, Lukas J. Fiderer, Hendrik Poulsen Nautrup +3 more

Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and studied extensively. Yet, our understanding of how these models compare, both mutually and to classical models, remains limited. In this work, we identify a constructive framework that captures all standard models based on parametrized quantum circuits: that of linear quantum models. In particular, we show using tools from quantum information theory how data re-uploading circuits, an apparent outlier of this framework, can be efficiently mapped into the simpler picture of linear models in quantum Hilbert spaces. Furthermore, we analyze the experimentally-relevant resource requirements of these models in terms of qubit number and amount of data needed to learn. Based on recent results from classical machine learning, we prove that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points. Our results provide a more comprehensive view of quantum machine learning models as well as insights on the compatibility of different models with NISQ constraints.

arXiv:2110.13162•Nature Communications•Jan 31, 2023•303 citations

Quantum Mechanics for Qubit Systems

Masahito Hayashi, Satoshi Ishizaka, Akinori Kawachi +2 more

Graduate texts in physics•Aug 22, 2014•0 citations

Quantum Circuits and Computation

François Chapeau‐Blondeau

Springer eBooks•Jan 1, 2026•0 citations

Simulating time evolution with fully optimized single-qubit gates on parametrized quantum circuits

Kaito Wada, Rudy Raymond, Yu‐ya Ohnishi +4 more

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.

arXiv:2111.05538•Physical Review A•Jun 13, 2022•24 citations
The model of an inaccurate continuous measurement of parametric energy conversion in the charge-phase qubit-detector of Rabi oscillation modes is presented. Apart from the inductive interaction of the qubit, the measuring circuit allows for the effect of continuous partial collapse of the qubit state with its inaccurate measurement. The present article considers the case of practically pure continuous inaccurate measurement of the signal qubit detector characteristics operating in a parametric energy conversion mode. To describe it we have used a previously developed [3] information approach to characterizing the dynamics of the afore-mentioned type of measurement based upon the the quantum Bayes theorem. We have also proposed a principle of invariance for a classical trajectory of the detector in the course of the continuous inaccurate measurement in relation to the mode of qubit quantomechanic description [4].
Machine learning algorithms based on parametrized quantum circuits are prime candidates for near-term applications on noisy quantum computers. In this direction, various types of quantum machine learning models have been introduced and studied extensively. Yet, our understanding of how these models compare, both mutually and to classical models, remains limited. In this work, we identify a constructive framework that captures all standard models based on parametrized quantum circuits: that of linear quantum models. In particular, we show using tools from quantum information theory how data re-uploading circuits, an apparent outlier of this framework, can be efficiently mapped into the simpler picture of linear models in quantum Hilbert spaces. Furthermore, we analyze the experimentally-relevant resource requirements of these models in terms of qubit number and amount of data needed to learn. Based on recent results from classical machine learning, we prove that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points. Our results provide a more comprehensive view of quantum machine learning models as well as insights on the compatibility of different models with NISQ constraints.
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.