Electrodynamics-based quantum gate optimization with born scattering
- PMID: 39468137
- PMCID: PMC11519954
- DOI: 10.1038/s41598-024-76636-y
Electrodynamics-based quantum gate optimization with born scattering
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.
Keywords: Dyson Series; Electron Scattering; Lagrange’s multiplier method; Quantum Electrodynamics; Quantum Gate Design.
© 2024. The Author(s).
Conflict of interest statement
On behalf of author, the corresponding author states that there is no conflict of interest.
Figures
References
-
- Feynman, R.P.:Simulating Physics with Computers, International Journal of Theoretical Physics, Vol.21, Nos. 6/7 (1982).
-
- Deutsch, D. Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. Proceedings of the Royal Society of London A400, 97–117 (1985).
-
- Shor, W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithm on a Quantum Computer. SIAM J. Comput.26(5), 1484–1509 (1997).
-
- Cleve, R., Ekert, A., Macchiavello, C. & Mosca, M. Quantum algorithms revisited. Proc. R. Soc. Lond. A454, 339 (1998).
-
- DiVincenzo, D. P. Two-bit gates are universal for quantum computation. Phys. Rev. A51, 1015 (1995). - PubMed
Grants and funding
LinkOut - more resources
Full Text Sources