Reproduce “Quantum State Preparation Based on LimTDD” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Xin Hong, Chenjian Li, Aochu Dai, Sanjiang Li, Shenggang Ying, Mingsheng Ying
This research introduces a quantum state preparation algorithm leveraging the Local Invertible Map Tensor Decision Diagram (LimTDD) to efficiently represent and decompose quantum states into quantum circuits. The method achieves lower gate counts and faster runtimes compared to existing ADD-based, Qiskit, and QuICT approaches, particularly for larger and more complex quantum states, demonstrating improved scalability.
Key insights
- LimTDD can compactly represent quantum states by leveraging Local Invertible Maps (LIMs) and identifying state isomorphisms, leading to a high compression ratio.
- The proposed algorithm effectively 'uncomputes' the quantum state represented by the LimTDD back to the initial |0⟩ state by applying inverse operators and adjusting complex weights through a recursive, branch-processing strategy.
- An ancilla qubit is crucial for systematically traversing and processing distinct branches of the LimTDD, allowing localized operations and subsequent simplification of the state.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.