Preparation of quantum superposition using partial negation
Sara Anwer, Ahmed Younes, Islam Elkabani, Ashraf Elsayed

TL;DR
This paper introduces a variational quantum circuit utilizing partial negation to efficiently prepare arbitrary quantum superpositions with high accuracy in linear steps, enhancing quantum algorithm performance.
Contribution
It proposes a novel variational quantum circuit based on partial negation operators for efficient superposition preparation, following unitary Lie group symmetries.
Findings
Prepares superpositions in O(n) steps
Achieves high accuracy compared to existing methods
Utilizes symmetries of the unitary Lie group
Abstract
The preparation of a quantum superposition is the key to the success of many quantum algorithms and quantum machine learning techniques. The preparation of an incomplete or a non-uniform quantum superposition with certain properties is a non-trivial task. In this paper, an -qubits variational quantum circuit using partial negation and controlled partial negation operators will be proposed to prepare an arbitrary quantum superposition. The proposed quantum circuit follows the symmetries of the unitary Lie group. The speed of the preparation process and the accuracy of the prepared superposition has a special importance to the success of any quantum algorithm. The proposed method can be used to prepare the required quantum superposition in steps and with high accuracy when compared with relevant methods in literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
