Preparation of 3-qubit states
Oscar Perdomo, Nelson Castaneda, Roger Vogeler

TL;DR
This paper introduces efficient methods for preparing real 3-qubit states using a limited set of quantum gates, improving upon previous algorithms by reducing the number of controlled-Z gates needed.
Contribution
It presents a new algorithm for preparing any 3-qubit state with fewer controlled-Z gates and discusses the optimality of gate counts for real states.
Findings
Any real 3-qubit state can be prepared with at most four controlled-Z gates.
A new algorithm prepares any 3-qubit state with at most three controlled-Z gates.
The proposed methods are demonstrated through illustrative videos.
Abstract
We will call a pure qubit state real if all its amplitudes are real numbers. We show that any real 3-qubit state can be prepared using gates and at most four controlled- gates, and we conjecture that four is optimal. We also present an algorithm -- different from the 2008 algorithm given by Znidaric, Giraud and Georgeot -- that prepares any 3-qubit state using local gates and at most three controlled- gates. Videos showing how our method works for two- and three-qubit states can be found at https://youtu.be/LIdYSs-rE-o and https://youtu.be/Kne0Vq7gyzQ
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 · Parallel Computing and Optimization Techniques · Numerical Methods and Algorithms
