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

arXiv:2304.03967

Quantum gate synthesis by small perturbation of a free particle in a box with electric field

Kumar Gautam

Published Apr 8, 2023• 0 citations
arXivHTMLPDF

Abstract

A quantum unitary gate is realized in this paper by perturbing a free charged particle in a one-dimensional box with a time- and position-varying electric field. The perturbed Hamiltonian is composed of a free particle Hamiltonian plus a perturbing electric potential such that the Schr$\ddot{o}$dinger evolution in time $T$, the unitary evolution operator of the unperturbed system after truncation to a finite number of energy levels, approximates a given unitary gate such as the quantum Fourier transform gate. The idea is to truncate the half-wave Fourier sine series to $M$ terms in the spatial variable $\mathbf x$ before extending the potential as a Dyson series in the interaction picture to compute the evolution operator matrix elements up to the linear and quadratic integral functionals of $ \mathbf V_n(t)'$s. As a result, we used the Dyson series with the Frobenius norm to reduce the difference between the derived gate energy and the given gate energy, and we determined the temporal performance criterion by plotting the noise-to-signal energy ratio (NSER). A mathematical explanation for a quantum gate's magnetic control has also been provided. In addition, we provide a mathematical explanation for a quantum gate that uses magnetic control.

DOI
10.48550/arxiv.2304.03967

Related papers

Design of Quantum Gates Using Quantum Scattering Theory

Harish Parthasarathy, Monika Aggarwal

Given two Hamiltonians \(H_0,H_1=H_0+V\) corresponding respectively to a free particle Hamiltonian and the free particle Hamiltonian plus its interaction energy with a scattering centre, we can compute the S-matrix, i.e., the matrix that determines the quantum mechanical amplitude of the process involving a particle coming from a free particle state at an infinite distance from the scattering centre at time \(t=-\infty\), entering into an initial scattered state, interacting with the scattering centre, entering into a final scattered state, and then escaping away to infinity at time \(t\rightarrow\infty\) to a final free particle state. Such amplitudes were first studied by Lippmann and Schwinger (Steven Weinberg, The Quantum Theory of Fields, Vol. 1, W.O. Amrein, Hilbert Space Methods in Quantum Mechanics) and then analyzed in a mathematically precise way by [T. Kato], [W. Amrein], and [K.B. Sinha]. In this paper, we first derive the Lippmann-Schwinger equation for the input and output scattered states in terms of the input and output free particle states using intuitive arguments originally due to Lippmann and Schwinger, and then, using rigorous operator theoretic arguments revolving around the spectral theorem for unbounded self-adjoint operators in a Hilbert space, we obtain an elegant formula for the scattering matrix elements in terms of the interaction potential and the free particle Hamiltonian between two free particle states corresponding to the same measure. We then discuss a computationally more efficient method based on the Dyson series expansion (Steven Weinberg, The Quantum Theory of Fields, Vol. 1), which works even in the case when the interaction Hamiltonian is time varying, in contrast to the Lippmann-Schwinger method, for calculating the S-matrix. We assume that the scattering potential, which can be time varying, can be controlled by incorporating control parameters and explain how the resulting unitary S-matrix can be made to approximate a given unitary gate in infinite-dimensional Hilbert space by optimizing the Hilbert-Schmidt/Frobenius norm distance between the given gate and the S-matrix gate, in which the latter is approximated by a truncated Dyson series. Of course, the S-matrix given by the Dyson series is a Taylor series functional expansion in the interaction potential and hence is a highly nonlinear function of the control parameters, and hence we propose numerical methods for such optimization. We then observe that if the control parameters are taken as random variables with joint moments, then the TPCP map involving statistical averaging of the adjoint action of the S-matrix acting on an initial mixed state w.r.t. the probability distribution of the control parameters will result in a final mixed state that is linear in the statistical moments of the control parameters, and hence optimization w.r.t. these moments can be easily carried out. Our method of TPCP map design is to optimize the sum of Frobenius distance squares between a sequence of desired output mixed states and the S-matrix based formula for the TPCP map acting on the corresponding input mixed states w.r.t. the statistical moments of the control parameters. We then generalize this method to include the case of TPCP maps obtained from the Hudson-Parthasarathy quantum noisy Schrödinger equation. In summary, we simulate the S-matrix gate for independent realizations of the control parameters having a probability distribution defined by their joint moments obtained by the above optimization procedure and apply the adjoint action of these independent S-matrices on a given input state, and take their ensemble average to obtain a good approximation to the action of the desired TPCP map on any given input state. This suggests that TPCP maps of arbitrarily large size can be realized using scattering experiments in the laboratory.

Qeios•Apr 16, 2024•0 citations

Performance analysis of quantum unitary gates in presence of noise in the field of quantum communication

Navneet Sharma, Tarun Kumar Rawat, Harish Parthasarathy +1 more

This paper presents the performance analysis of unitary quantum gate in presence of noise, using the time dependent Schrödinger dynamics of system Hamiltonian. The perturbed Hamiltonian is expressed as the sum of unperturbed Hamiltonian and perturbation of any real valued controllable function. The basic idea is to maintain the unitarity for corresponding time evolutionary system after time T and it is achieved after solving the time-dependent Schrodinger equation along with Dyson series expansion. This work presents the behaviour of time evolutionary process of quantum system, first without noise and then in the presence of noise. The aim of this paper is to provide a simple mathematical approach for realizing the approximate unitary quantum gates when noise is having its appearance in corresponding quantum control field.

India International Conference on Power Electronics (IICPE)•Nov 1, 2016•0 citations

Quantum Algorithm for Time-Dependent Hamiltonian Simulation by Permutation Expansion

Yi‐Hsiang Chen, Amir Kalev, Itay Hen

We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians.Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series of the time-evolution operator.Under this representation, we perform a quantum simulation for the time-evolution operator by means of the linear combination of unitaries technique.We optimize the time steps of the evolution based on the Hamiltonian's dynamical characteristics, leading to a gate count that scales with an L 1 -norm-like scaling with respect only to the norm of the interaction Hamiltonian, rather than that of the total Hamiltonian.We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies, implying its advantage for systems with highly oscillating components, and for time-decaying systems the cost does not scale with the total evolution time asymptotically.In addition, our algorithm retains the near optimal log(1/ )/ log log(1/ ) scaling with simulation error .

arXiv:2103.15334•PRX Quantum•Sep 9, 2021•31 citations

A topical review on time-independent perturbation theory in one-dimensional quantum systems

Leonardo Lavagna, Sandra Carillo, Massimo Panella

Abstract This review presents time-independent perturbative methods for solving the one-dimensional Schrödinger equation, highlighting representative cases that reveal key aspects of the theory. The focus is on their relevance to quantum computing applications, particularly in systems with finite-dimensional state spaces. The main link between these methods and quantum processing emerges when we consider systems with only a finite number of well-defined energy levels, e.g., two levels corresponding to the ‘zero’ and ‘one’ states of a quantum bit (qubit), for which the Schrödinger equation describes a quantum algorithm corresponding to the unitary evolution of the qubits. Perturbative techniques can then be applied to this evolution to gain deeper insight into the algorithm or to simplify it in a controlled manner, as described in the last sections of this review. We initially discuss representative applications using benchmark cases that exemplify the essential features of perturbation theory while avoiding unnecessary technical complications. The methods presented involve direct approaches to solutions for quantum systems with small potential perturbations, with consideration of indirect and approximation techniques. Key cases examined include the particle in a potential well, the harmonic oscillator, and systems with polynomial or Dirac delta distribution perturbations, each chosen to highlight unique aspects of perturbative analysis. Starting with an overview of the unperturbed Schrödinger equation, we derive canonical solutions and then use perturbative techniques to approximate energy shifts and wavefunction corrections in both non-degenerate and degenerate settings. By combining theoretical discussion with case studies, this review underscores how perturbative methods are applied across a range of elementary quantum mechanical problems especially for applications in the qubit model, which, in many cases of interest, can be reduced to the explicit calculations shown here.

Physica Scripta•Sep 23, 2025•0 citations

Fourier-based quantum signal processing

Thais de Lima Silva, Borges, Lucas, Leandro Aolita

Implementing general functions of operators is a powerful tool in quantum computation. It can be used as the basis for a variety of quantum algorithms including matrix inversion, real and imaginary-time evolution, and matrix powers. Quantum signal processing is the state of the art for this aim, assuming that the operator to be transformed is given as a block of a unitary matrix acting on an enlarged Hilbert space. Here we present an algorithm for Hermitian-operator function design from an oracle given by the unitary evolution with respect to that operator at a fixed time. Our algorithm implements a Fourier approximation of the target function based on the iteration of a basic sequence of single-qubit gates, for which we prove the expressibility. In addition, we present an efficient classical algorithm for calculating its parameters from the Fourier series coefficients. Our algorithm uses only one qubit ancilla regardless the degree of the approximating series. This contrasts with previous proposals, which required an ancillary register of size growing with the expansion degree. Our methods are compatible with Trotterised Hamiltonian simulations schemes and hybrid digital-analog approaches.

arXiv:2206.02826•Jun 6, 2022•3 citations

Reverse engineering of single-qubit quantum gates

Gustavo Fernandes da Costa, Leonardo K. Castelano, Emanuel Fernandes de Lima

In this work, we address the problem of designing single-qubit quantum gates by means of a linearly-polarized field. We show that any desired one-qubit gate corresponding to a special unitary matrix can be generated by a modulated sinusoidal field. The only approximation involved is the rotating-wave-approximation. The formula for the control field is obtained by inverting the equation of motion for the evolution operator and imposing the conditions for the desired gate. We give a simple procedure to obtain closed analytical formulas for the fields in terms of a priori chosen dynamical functions. Additionally, these dynamical functions can depend on tunable free parameters intentionally introduced to meet a desired performance criteria.

quant-pharXiv:2607.16124•Jul 20, 2026•0 citations
A quantum unitary gate is realized in this paper by perturbing a free charged particle in a one-dimensional box with a time- and position-varying electric field. The perturbed Hamiltonian is composed of a free particle Hamiltonian plus a perturbing electric potential such that the Schro¨\ddot{o}o¨dinger evolution in time TTT, the unitary evolution operator of the unperturbed system after truncation to a finite number of energy levels, approximates a given unitary gate such as the quantum Fourier transform gate. The idea is to truncate the half-wave Fourier sine series to MMM terms in the spatial variable x\mathbf xx before extending the potential as a Dyson series in the interaction picture to compute the evolution operator matrix elements up to the linear and quadratic integral functionals of Vn(t)′ \mathbf V_n(t)'Vn​(t)′s. As a result, we used the Dyson series with the Frobenius norm to reduce the difference between the derived gate energy and the given gate energy, and we determined the temporal performance criterion by plotting the noise-to-signal energy ratio (NSER). A mathematical explanation for a quantum gate's magnetic control has also been provided. In addition, we provide a mathematical explanation for a quantum gate that uses magnetic control.
Given two Hamiltonians H0,H1=H0+VH_0,H_1=H_0+VH0​,H1​=H0​+V corresponding respectively to a free particle Hamiltonian and the free particle Hamiltonian plus its interaction energy with a scattering centre, we can compute the S-matrix, i.e., the matrix that determines the quantum mechanical amplitude of the process involving a particle coming from a free particle state at an infinite distance from the scattering centre at time t=−∞t=-\inftyt=−∞, entering into an initial scattered state, interacting with the scattering centre, entering into a final scattered state, and then escaping away to infinity at time t→∞t\rightarrow\inftyt→∞ to a final free particle state. Such amplitudes were first studied by Lippmann and Schwinger (Steven Weinberg, The Quantum Theory of Fields, Vol. 1, W.O. Amrein, Hilbert Space Methods in Quantum Mechanics) and then analyzed in a mathematically precise way by [T. Kato], [W. Amrein], and [K.B. Sinha]. In this paper, we first derive the Lippmann-Schwinger equation for the input and output scattered states in terms of the input and output free particle states using intuitive arguments originally due to Lippmann and Schwinger, and then, using rigorous operator theoretic arguments revolving around the spectral theorem for unbounded self-adjoint operators in a Hilbert space, we obtain an elegant formula for the scattering matrix elements in terms of the interaction potential and the free particle Hamiltonian between two free particle states corresponding to the same measure. We then discuss a computationally more efficient method based on the Dyson series expansion (Steven Weinberg, The Quantum Theory of Fields, Vol. 1), which works even in the case when the interaction Hamiltonian is time varying, in contrast to the Lippmann-Schwinger method, for calculating the S-matrix. We assume that the scattering potential, which can be time varying, can be controlled by incorporating control parameters and explain how the resulting unitary S-matrix can be made to approximate a given unitary gate in infinite-dimensional Hilbert space by optimizing the Hilbert-Schmidt/Frobenius norm distance between the given gate and the S-matrix gate, in which the latter is approximated by a truncated Dyson series. Of course, the S-matrix given by the Dyson series is a Taylor series functional expansion in the interaction potential and hence is a highly nonlinear function of the control parameters, and hence we propose numerical methods for such optimization. We then observe that if the control parameters are taken as random variables with joint moments, then the TPCP map involving statistical averaging of the adjoint action of the S-matrix acting on an initial mixed state w.r.t. the probability distribution of the control parameters will result in a final mixed state that is linear in the statistical moments of the control parameters, and hence optimization w.r.t. these moments can be easily carried out. Our method of TPCP map design is to optimize the sum of Frobenius distance squares between a sequence of desired output mixed states and the S-matrix based formula for the TPCP map acting on the corresponding input mixed states w.r.t. the statistical moments of the control parameters. We then generalize this method to include the case of TPCP maps obtained from the Hudson-Parthasarathy quantum noisy Schrödinger equation. In summary, we simulate the S-matrix gate for independent realizations of the control parameters having a probability distribution defined by their joint moments obtained by the above optimization procedure and apply the adjoint action of these independent S-matrices on a given input state, and take their ensemble average to obtain a good approximation to the action of the desired TPCP map on any given input state. This suggests that TPCP maps of arbitrarily large size can be realized using scattering experiments in the laboratory.
This paper presents the performance analysis of unitary quantum gate in presence of noise, using the time dependent Schrödinger dynamics of system Hamiltonian. The perturbed Hamiltonian is expressed as the sum of unperturbed Hamiltonian and perturbation of any real valued controllable function. The basic idea is to maintain the unitarity for corresponding time evolutionary system after time T and it is achieved after solving the time-dependent Schrodinger equation along with Dyson series expansion. This work presents the behaviour of time evolutionary process of quantum system, first without noise and then in the presence of noise. The aim of this paper is to provide a simple mathematical approach for realizing the approximate unitary quantum gates when noise is having its appearance in corresponding quantum control field.
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians.Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series of the time-evolution operator.Under this representation, we perform a quantum simulation for the time-evolution operator by means of the linear combination of unitaries technique.We optimize the time steps of the evolution based on the Hamiltonian's dynamical characteristics, leading to a gate count that scales with an L 1 -norm-like scaling with respect only to the norm of the interaction Hamiltonian, rather than that of the total Hamiltonian.We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies, implying its advantage for systems with highly oscillating components, and for time-decaying systems the cost does not scale with the total evolution time asymptotically.In addition, our algorithm retains the near optimal log(1/ )/ log log(1/ ) scaling with simulation error .
Abstract This review presents time-independent perturbative methods for solving the one-dimensional Schrödinger equation, highlighting representative cases that reveal key aspects of the theory. The focus is on their relevance to quantum computing applications, particularly in systems with finite-dimensional state spaces. The main link between these methods and quantum processing emerges when we consider systems with only a finite number of well-defined energy levels, e.g., two levels corresponding to the ‘zero’ and ‘one’ states of a quantum bit (qubit), for which the Schrödinger equation describes a quantum algorithm corresponding to the unitary evolution of the qubits. Perturbative techniques can then be applied to this evolution to gain deeper insight into the algorithm or to simplify it in a controlled manner, as described in the last sections of this review. We initially discuss representative applications using benchmark cases that exemplify the essential features of perturbation theory while avoiding unnecessary technical complications. The methods presented involve direct approaches to solutions for quantum systems with small potential perturbations, with consideration of indirect and approximation techniques. Key cases examined include the particle in a potential well, the harmonic oscillator, and systems with polynomial or Dirac delta distribution perturbations, each chosen to highlight unique aspects of perturbative analysis. Starting with an overview of the unperturbed Schrödinger equation, we derive canonical solutions and then use perturbative techniques to approximate energy shifts and wavefunction corrections in both non-degenerate and degenerate settings. By combining theoretical discussion with case studies, this review underscores how perturbative methods are applied across a range of elementary quantum mechanical problems especially for applications in the qubit model, which, in many cases of interest, can be reduced to the explicit calculations shown here.
Implementing general functions of operators is a powerful tool in quantum computation. It can be used as the basis for a variety of quantum algorithms including matrix inversion, real and imaginary-time evolution, and matrix powers. Quantum signal processing is the state of the art for this aim, assuming that the operator to be transformed is given as a block of a unitary matrix acting on an enlarged Hilbert space. Here we present an algorithm for Hermitian-operator function design from an oracle given by the unitary evolution with respect to that operator at a fixed time. Our algorithm implements a Fourier approximation of the target function based on the iteration of a basic sequence of single-qubit gates, for which we prove the expressibility. In addition, we present an efficient classical algorithm for calculating its parameters from the Fourier series coefficients. Our algorithm uses only one qubit ancilla regardless the degree of the approximating series. This contrasts with previous proposals, which required an ancillary register of size growing with the expansion degree. Our methods are compatible with Trotterised Hamiltonian simulations schemes and hybrid digital-analog approaches.
In this work, we address the problem of designing single-qubit quantum gates by means of a linearly-polarized field. We show that any desired one-qubit gate corresponding to a special unitary matrix can be generated by a modulated sinusoidal field. The only approximation involved is the rotating-wave-approximation. The formula for the control field is obtained by inverting the equation of motion for the evolution operator and imposing the conditions for the desired gate. We give a simple procedure to obtain closed analytical formulas for the fields in terms of a priori chosen dynamical functions. Additionally, these dynamical functions can depend on tunable free parameters intentionally introduced to meet a desired performance criteria.