Quantum State Preparation Based on LimTDD
- URL: http://arxiv.org/abs/2507.14496v1
- Date: Sat, 19 Jul 2025 06:00:27 GMT
- Title: Quantum State Preparation Based on LimTDD
- Authors: Xin Hong, Chenjian Li, Aochu Dai, Sanjiang Li, Shenggang Ying, Mingsheng Ying,
- Abstract summary: This paper proposes a novel approach for quantum state preparation based on the Local Invertible Map Diagram (LimTDD)<n>LimTDD combines the advantages of tensor networks and decision diagrams, enabling efficient representation of quantum states.
- Score: 5.328178128965817
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum state preparation is a fundamental task in quantum computing and quantum information processing. With the rapid advancement of quantum technologies, efficient quantum state preparation has become increasingly important. This paper proposes a novel approach for quantum state preparation based on the Local Invertible Map Tensor Decision Diagram (LimTDD). LimTDD combines the advantages of tensor networks and decision diagrams, enabling efficient representation and manipulation of quantum states. Compared with the state-of-the-art quantum state preparation method, LimTDD demonstrates substantial improvements in efficiency when dealing with complex quantum states, while also reducing the complexity of quantum circuits. Examples indicate that, in the best-case scenario, our method can achieve exponential efficiency gains over existing methods. This study not only highlights the potential of LimTDD in quantum state preparation but also provides a robust theoretical and practical foundation for the future development of quantum computing technologies.
Related papers
- Minimizing entanglement entropy for enhanced quantum state preparation [0.0]
We present and analyze a novel two-step state preparation method.<n>The state with reduced entanglement entropy is then represented as a matrix product state.<n>Our method is suitable for NISQ devices and we give rigorous lower bounds on the accuracy of the prepared state.
arXiv Detail & Related papers (2025-07-30T10:37:07Z) - Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps [5.328178128965817]
We propose a family of efficient Quantum State Preparation (QSP) algorithms tailored to different numbers of available ancilla qubits.<n>Our approach exploits the power of Local Invertible Map Decision Diagrams (LimTDDs) to reduce quantum circuit complexity.
arXiv Detail & Related papers (2025-07-23T03:34:44Z) - VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - Hamiltonian Dynamics Learning: A Scalable Approach to Quantum Process Characterization [6.741097425426473]
We introduce an efficient quantum process learning method specifically designed for short-time Hamiltonian dynamics.<n>We demonstrate applications in quantum machine learning, where our protocol enables efficient training of variational quantum neural networks by directly learning unitary transformations.<n>This work establishes a new theoretical foundation for practical quantum dynamics learning, paving the way for scalable quantum process characterization in both near-term and fault-tolerant quantum computing.
arXiv Detail & Related papers (2025-03-31T14:50:00Z) - Quantum framework for Reinforcement Learning: Integrating Markov decision process, quantum arithmetic, and trajectory search [0.6062751776009752]
This paper introduces a quantum framework for addressing reinforcement learning (RL) tasks.<n>By employing quantum concepts and a quantum search algorithm, this work presents the implementation and optimization of the agent-environment interactions.<n>Results demonstrate the capacity of a quantum model to achieve quantum enhancement in RL.
arXiv Detail & Related papers (2024-12-24T06:28:34Z) - Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
Quantum computers have the potential to solve intractable problems.
One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems.
In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
arXiv Detail & Related papers (2024-06-05T18:00:01Z) - Computable and Faithful Lower Bound on Entanglement Cost [5.086696108576776]
We develop computable and faithful lower bounds on the entanglement cost under quantum operations.<n>Our bounds are efficiently computable via semidefinite programming.<n>We extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels.
arXiv Detail & Related papers (2023-11-17T17:07:26Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.