Pith. sign in

REVIEW

Quantum Fourier Transform in Oscillating Modes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.09861 v2 pith:S7GOI2QF submitted 2019-12-20 quant-ph

Quantum Fourier Transform in Oscillating Modes

classification quant-ph
keywords quantumqubitsalgorithmsancillaformfourierhilbertrecycling
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.