Quick Navigation
Topics
Trapped Ion Quantum Computing
Superconducting Qubits
Quantum Fourier Transform in Oscillating Modes
arXiv
Authors: Qi-Ming Chen, Frank Deppe, Re-Bing Wu, Luyan Sun, Yu-xi Liu, Yuki Nojiri, Stefan Pogorzalek, Michael Renger, Matti Partanen, Kirill G. Fedorov, Achim Marx, Rudolf Gross
Year
2019
Paper ID
39694
Status
Preprint
Abstract Read
~2 min
Abstract Words
181
Citations
N/A
Abstract
Quantum Fourier transform (QFT) is a key ingredient of many quantum algorithms where a considerable amount of ancilla qubits and gates are often needed to form a Hilbert space large enough for high-precision results. Qubit recycling reduces the number of ancilla qubits to one but imposes the requirement of repeated measurements and feedforward within the coherence time of the qubits. Moreover, recycling only applies to certain cases where QFT can be carried out in a semi-classical way. Here, we report a novel approach based on two harmonic resonators which form a high-dimensional Hilbert space for the realization of QFT. By employing the all-resonant and perfect state-transfer methods, we develop a protocol that transfers an unknown multi-qubit state to one resonator. QFT is performed by the free evolution of the two resonators with a cross-Kerr interaction. Then, the fully-quantum result can be localized in the second resonator by a projective measurement. Qualitative analysis shows that a 2^10-dimensional QFT can be realized in current superconducting quantum circuits which paves the way for implementing various quantum algorithms in the noisy intermediate-scale quantum (NISQ) era.
Why This Paper Matters
- This paper contributes to the Superconducting Qubits research area in the Quantum Articles archive.
- It adds a 2019 reference point for readers tracking recent quantum research.
- Quantum Fourier transform (QFT) is a key ingredient of many quantum algorithms where a considerable amount of ancilla qubits and gates are often needed to form a Hilbert space...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.