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

Scientific Reports

Electrodynamics-based quantum gate optimization with born scattering

Kumar Gautam, Chang Wook Ahn

Published Oct 28, 2024• 5 citations
Publisher

Abstract

In this paper, we propose employing electron scattering to realize unitary quantum gates that are controlled by three qubits. Using Feynman's rules, we find an expression for the transition amplitude for scattering from an external electromagnetic source. In this context, the scattering amplitude is modeled as a unitary gate whose state can be regulated. The optimal value of the vector potential needed to implement the gate is obtained by minimizing the difference between the designed gate and the target gate, with the total energy consumed as a constraint. The design algorithm is obtained by discretizing the resulting integral equations into vector equations. This design algorithm can be applied in various fields such as quantum computing, communication, and sensing. It offers a promising approach for developing efficient and accurate gates for quantum information processing. Furthermore, this approach can also be extended to design gates for multi-qubit systems, which are essential for large-scale quantum computing. The use of this algorithm can significantly contribute to the development of practical quantum technologies.

DOI
10.1038/s41598-024-76636-y

Related papers

Unitary transformations for quantum computing

Juha J. Vartiainen

The last two decades have seen an enormous increase in the computational power of digital computers. This was due to the rapid technical development in manufacturing processes and controlling semiconducting structures on submicron scale. Concurrently, the electric circuits have encountered the first signs of the realm of quantum mechanics. Those effects may induce noise and thus they are typically considered harmful. However, the manipulation of the coherent quantum states might turn out be the basis of powerful computers – quantum computers. There, the computation is encoded into the unitary time evolution of a quantum mechanical state vector. Eventually, quantum mechanics could enable one, for example, to read secret electronic messages which are encrypted by the widely employed RSA cryptosystem – a task which is extremely laborious for the current digital computers. This thesis presents a theoretical study of the coherent manipulations of pure quantum states in a quantum register, that is, quantum algorithms. An implementation of a quantum algorithm involves the initialization of the input state and its manipulation with quantum gates followed by the measurements. The physical implementation of each gate requires that it is decomposed into low-level gates whose physical realizations are explicitly known. Here, the problem is examined from two directions. Firstly, the numerical optimization scheme for controlling time-evolution of a closed quantum system is discussed. This yields a method for implementing quantum gates acting on up to three quantum bits, qubits. The approach is independent of the physical realization of the quantum computer, but it is considered explicitly for a proposed inductively coupled Josephson charge qubit register. Secondly, the techniques of numerical matrix computation are utilized to find a general method for decomposing an arbitrary n-qubit gate into a sequence of elementary gates, which act on one or two qubits. The results of this thesis help to improve the implementation of quantum algorithms. The quantum circuit construction developed in the thesis is the first one to achieve the asymptotically minimal complexity in the number of elementary gates. In context of acceleration of quantum algorithms we present a gate-level study of Shor's algorithm and show how to accelerate the algorithm by merging several elementary gates into multiqubit gates. Finally, the requirements set by the resulting gate array are compared to the properties of superconducting qubits. This allows us to discuss the feasibility of the Josephson charge qubit register, for instance, as hardware for breaking the RSA cryptosystem.

•Apr 8, 2005•2 citations

Designing Grover’s quantum searching algorithm for 2-qubit and 3-qubit states of quantum systems

Sh. A. Toirov, U. X. Mingboyev, A. A. Parmonov +1 more

This paper develops and analyzes Grover’s quantum search algorithm in 2- and 3-qubit systems in terms of the number of gates, representation of state vectors, and state vector measurement probabilities. We designed, verified and simulated the quantum circuit using QCAD. We present a theoretical implementation of the search algorithm in different qubit systems. We may observe that our circuit design for 2-qubit systems is accurate and does not allow any error when a small error occurs in the design of a 3-qubit quantum system. it was considered to what extend given information about object of the research is used purposefully in the modeling process, as a result of mathematical analysis of Grover’s method of the quantum algorithm, i.e. it is important to provide the adequacy of the model. The results of the optimization performed with the quantum algorithm based on Grover’s method are presented.

AIP conference proceedings•Jan 1, 2024•0 citations

Monte Carlo approach for finding optimally controlled quantum gates with differential geometry

Adonai Hilário da Silva, L. K. Castelano, Reginaldo de Jesus Napolitano

A unitary evolution in time may be treated as a curve in the manifold of the special unitary group. The length of such a curve can be related to the energetic cost of the associated computation, meaning a geodesic curve identifies an energetically optimal path. In this work, we employ sub-Riemannian geometry on the manifold of the unitary group to obtain optimally designed Hamiltonians for generating single-qubit gates in an environment with the presence of dephasing noise as well as a two-qubit gate under a time-constant crosstalk interaction. The resulting geodesic equation involves knowing the initial conditions of the parameters that cannot be obtained analytically. We then introduce a random sampling method combined with a minimization function and a cost function to find initial conditions that lead to optimal control fields. We also compare the optimized control fields obtained from the solutions of the geodesic equation with those extracted from the well-known Krotov method. Both approaches provide high-fidelity values for the desired quantum gate implementation, but the geodesic method has the advantage of minimizing the required energy to execute the same task. These findings bring insights for the design of more efficient fields in the arsenal of optimal control theory.

arXiv:2503.09593•Physical Review A•Oct 8, 2025•3 citations

Dissipation as a resource in quantum algorithms

Elias Zapusek

Quantum information processing holds immense promise, but its practical implementation is fundamentally challenged by dissipation, the irreversible loss of information and energy to the environment. The conventional approach treats dissipation as an obstacle to overcome, typically through resource-intensive quantum error correction. Such schemes impose overheads of orders of magnitude in terms of both qubits and operations. This creates significant space, control and time costs, making near-term practical implementation highly challenging. This thesis adopts a different viewpoint, harnessing dissipation for quantum algorithms. We explore the design, application, and conceptual advantages of dissipative quantum algorithms. We establish the foundational tools for this approach by demonstrating how to engineer a universal set of nonunitary operations using intrinsic, controllable dissipation. We present a hardware-efficient method, experimentally realized in a trapped-ion system, for implementing any two-qubit Markovian quantum channel without requiring ancilla qubits or measurements. This provides a practical and versatile toolbox for constructing dissipative algorithms on near-term quantum devices. Building on this, we apply these tools to an inherently dissipative task: the preparation of thermal states. We introduce a variational quantum-classical algorithm that integrates engineered nonunitary operations with unitary gates. By leveraging weak symmetries of the target Hamiltonian, we design efficient ansätze that significantly improve the fidelity of state preparation. Finally, we address one of the most significant barriers to scaling variational quantum algorithms: the prevalence of barren plateaus, where optimization gradients vanish exponentially with system size. We prove that dissipative algorithms, by incorporating periodic qubit resets, can mitigate both noise-induced and unitary barren plateaus. This mechanism allows for a class of scalable computations that are intractable for purely unitary approaches in the presence of noise. Together, these results demonstrate that dissipation is not just a source of error, but a powerful resource. By systematically developing the necessary operations, applying them to relevant problems, and identifying fundamental scalability advantages, this work showcases dissipative quantum computing as a compelling avenue in quantum information processing.

•Jan 1, 2025•1 citation

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

Optimal simulation of three-qubit gates

Nengkun Yu, Mingsheng Ying

In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit gate cost of simulating a three-qubit controlled controlled gate by generalizing our result on the cost of Toffoli gate. The function of controlled controlled gate is simply a three-qubit controlled unitary gate and can be intuitively explained as follows: the gate will output the states of the two control qubit directly, and apply the given one-qubit unitary $u$ on the target qubit only if both the states of the control are $\ket{1}$. Previously, it is only known that five two-qubit gates is sufficient for implementing such a gate [Sleator and Weinfurter, Phys. Rev. Lett. 74, 4087 (1995)]. Our result shows that if the determinant of $u$ is 1, four two-qubit gates is achievable optimal. Otherwise, five is optimal. Thirdly, we show that five two-qubit gates are necessary and sufficient for implementing the Fredkin gate(the controlled swap gate), which settles the open problem introduced in [Smolin and DiVincenzo, Phys. Rev. A, 53, 2855 (1996)]. The Fredkin gate is one of the most important quantum logic gates because it is universal alone for classical reversible computation, and thus with little help, universal for quantum computation. Before our work, a five two-qubit gates decomposition of the Fredkin gate was already known, and numerical evidence of showing five is optimal is found.

arXiv:1301.3727•Jan 16, 2013•7 citations
In this paper, we propose employing electron scattering to realize unitary quantum gates that are controlled by three qubits. Using Feynman's rules, we find an expression for the transition amplitude for scattering from an external electromagnetic source. In this context, the scattering amplitude is modeled as a unitary gate whose state can be regulated. The optimal value of the vector potential needed to implement the gate is obtained by minimizing the difference between the designed gate and the target gate, with the total energy consumed as a constraint. The design algorithm is obtained by discretizing the resulting integral equations into vector equations. This design algorithm can be applied in various fields such as quantum computing, communication, and sensing. It offers a promising approach for developing efficient and accurate gates for quantum information processing. Furthermore, this approach can also be extended to design gates for multi-qubit systems, which are essential for large-scale quantum computing. The use of this algorithm can significantly contribute to the development of practical quantum technologies.
The last two decades have seen an enormous increase in the computational power of digital computers. This was due to the rapid technical development in manufacturing processes and controlling semiconducting structures on submicron scale. Concurrently, the electric circuits have encountered the first signs of the realm of quantum mechanics. Those effects may induce noise and thus they are typically considered harmful. However, the manipulation of the coherent quantum states might turn out be the basis of powerful computers – quantum computers. There, the computation is encoded into the unitary time evolution of a quantum mechanical state vector. Eventually, quantum mechanics could enable one, for example, to read secret electronic messages which are encrypted by the widely employed RSA cryptosystem – a task which is extremely laborious for the current digital computers. This thesis presents a theoretical study of the coherent manipulations of pure quantum states in a quantum register, that is, quantum algorithms. An implementation of a quantum algorithm involves the initialization of the input state and its manipulation with quantum gates followed by the measurements. The physical implementation of each gate requires that it is decomposed into low-level gates whose physical realizations are explicitly known. Here, the problem is examined from two directions. Firstly, the numerical optimization scheme for controlling time-evolution of a closed quantum system is discussed. This yields a method for implementing quantum gates acting on up to three quantum bits, qubits. The approach is independent of the physical realization of the quantum computer, but it is considered explicitly for a proposed inductively coupled Josephson charge qubit register. Secondly, the techniques of numerical matrix computation are utilized to find a general method for decomposing an arbitrary n-qubit gate into a sequence of elementary gates, which act on one or two qubits. The results of this thesis help to improve the implementation of quantum algorithms. The quantum circuit construction developed in the thesis is the first one to achieve the asymptotically minimal complexity in the number of elementary gates. In context of acceleration of quantum algorithms we present a gate-level study of Shor's algorithm and show how to accelerate the algorithm by merging several elementary gates into multiqubit gates. Finally, the requirements set by the resulting gate array are compared to the properties of superconducting qubits. This allows us to discuss the feasibility of the Josephson charge qubit register, for instance, as hardware for breaking the RSA cryptosystem.
This paper develops and analyzes Grover’s quantum search algorithm in 2- and 3-qubit systems in terms of the number of gates, representation of state vectors, and state vector measurement probabilities. We designed, verified and simulated the quantum circuit using QCAD. We present a theoretical implementation of the search algorithm in different qubit systems. We may observe that our circuit design for 2-qubit systems is accurate and does not allow any error when a small error occurs in the design of a 3-qubit quantum system. it was considered to what extend given information about object of the research is used purposefully in the modeling process, as a result of mathematical analysis of Grover’s method of the quantum algorithm, i.e. it is important to provide the adequacy of the model. The results of the optimization performed with the quantum algorithm based on Grover’s method are presented.
A unitary evolution in time may be treated as a curve in the manifold of the special unitary group. The length of such a curve can be related to the energetic cost of the associated computation, meaning a geodesic curve identifies an energetically optimal path. In this work, we employ sub-Riemannian geometry on the manifold of the unitary group to obtain optimally designed Hamiltonians for generating single-qubit gates in an environment with the presence of dephasing noise as well as a two-qubit gate under a time-constant crosstalk interaction. The resulting geodesic equation involves knowing the initial conditions of the parameters that cannot be obtained analytically. We then introduce a random sampling method combined with a minimization function and a cost function to find initial conditions that lead to optimal control fields. We also compare the optimized control fields obtained from the solutions of the geodesic equation with those extracted from the well-known Krotov method. Both approaches provide high-fidelity values for the desired quantum gate implementation, but the geodesic method has the advantage of minimizing the required energy to execute the same task. These findings bring insights for the design of more efficient fields in the arsenal of optimal control theory.
Quantum information processing holds immense promise, but its practical implementation is fundamentally challenged by dissipation, the irreversible loss of information and energy to the environment. The conventional approach treats dissipation as an obstacle to overcome, typically through resource-intensive quantum error correction. Such schemes impose overheads of orders of magnitude in terms of both qubits and operations. This creates significant space, control and time costs, making near-term practical implementation highly challenging. This thesis adopts a different viewpoint, harnessing dissipation for quantum algorithms. We explore the design, application, and conceptual advantages of dissipative quantum algorithms. We establish the foundational tools for this approach by demonstrating how to engineer a universal set of nonunitary operations using intrinsic, controllable dissipation. We present a hardware-efficient method, experimentally realized in a trapped-ion system, for implementing any two-qubit Markovian quantum channel without requiring ancilla qubits or measurements. This provides a practical and versatile toolbox for constructing dissipative algorithms on near-term quantum devices. Building on this, we apply these tools to an inherently dissipative task: the preparation of thermal states. We introduce a variational quantum-classical algorithm that integrates engineered nonunitary operations with unitary gates. By leveraging weak symmetries of the target Hamiltonian, we design efficient ansätze that significantly improve the fidelity of state preparation. Finally, we address one of the most significant barriers to scaling variational quantum algorithms: the prevalence of barren plateaus, where optimization gradients vanish exponentially with system size. We prove that dissipative algorithms, by incorporating periodic qubit resets, can mitigate both noise-induced and unitary barren plateaus. This mechanism allows for a class of scalable computations that are intractable for purely unitary approaches in the presence of noise. Together, these results demonstrate that dissipation is not just a source of error, but a powerful resource. By systematically developing the necessary operations, applying them to relevant problems, and identifying fundamental scalability advantages, this work showcases dissipative quantum computing as a compelling avenue in quantum information processing.
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.
In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit gate cost of simulating a three-qubit controlled controlled gate by generalizing our result on the cost of Toffoli gate. The function of controlled controlled gate is simply a three-qubit controlled unitary gate and can be intuitively explained as follows: the gate will output the states of the two control qubit directly, and apply the given one-qubit unitary uuu on the target qubit only if both the states of the control are ∣1⟩\ket{1}∣1⟩. Previously, it is only known that five two-qubit gates is sufficient for implementing such a gate [Sleator and Weinfurter, Phys. Rev. Lett. 74, 4087 (1995)]. Our result shows that if the determinant of uuu is 1, four two-qubit gates is achievable optimal. Otherwise, five is optimal. Thirdly, we show that five two-qubit gates are necessary and sufficient for implementing the Fredkin gate(the controlled swap gate), which settles the open problem introduced in [Smolin and DiVincenzo, Phys. Rev. A, 53, 2855 (1996)]. The Fredkin gate is one of the most important quantum logic gates because it is universal alone for classical reversible computation, and thus with little help, universal for quantum computation. Before our work, a five two-qubit gates decomposition of the Fredkin gate was already known, and numerical evidence of showing five is optimal is found.