Practical, optimal preparation of general quantum state with exponentially improved robustness
- URL: http://arxiv.org/abs/2411.02782v2
- Date: Wed, 06 Nov 2024 02:07:48 GMT
- Title: Practical, optimal preparation of general quantum state with exponentially improved robustness
- Authors: Xiao-Ming Zhang,
- Abstract summary: In this work, we overcome existing methods with a bucket-brigade approach.
Our approach is the first to simultaneously achieve linear Clifford$+T$ circuit depth, gate count number, and space-time allocation.
These advancements offer the opportunity for processing big data in both near-term and fault-tolerant quantum devices.
- Score: 5.149586838873632
- License:
- Abstract: Quantum state preparation, as a general process of loading classical data to quantum device, is essential for end-to-end implementation of quantum algorithms. Yet, existing methods suffer from either high circuit depth or complicated hardware, limiting their practicality and robustness. In this work, we overcome these limitations with a bucket-brigade approach. The tree architectures of our hardware represents the simplest connectivity required for achieving sub-exponential circuit depth. Leveraging the bucket-brigade mechanism that can suppress the error propagation between different branches, our approach exhibit exponential improvement on the robustness compared to existing depth-optimal methods. More specifically, the infidelity scales as $O(\text{polylog}(N))$ with data size $N$, as oppose to $O(N)$ for conventional methods. Moreover, our approach is the first to simultaneously achieve linear Clifford$+T$ circuit depth, gate count number, and space-time allocation. These advancements offer the opportunity for processing big data in both near-term and fault-tolerant quantum devices.
Related papers
- SWAP-less Implementation of Quantum Algorithms [0.0]
We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity.
We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
arXiv Detail & Related papers (2024-08-20T14:51:00Z) - Adaptive Circuit Learning of Born Machine: Towards Realization of
Amplitude Embedding and Data Loading [7.88657961743755]
We present a novel algorithm "Adaptive Circuit Learning of Born Machine" (ACLBM)
Our algorithm is tailored to selectively integrate two-qubit entangled gates that best capture the complex entanglement present within the target state.
Empirical results underscore the proficiency of our approach in encoding real-world data through amplitude embedding.
arXiv Detail & Related papers (2023-11-29T16:47:31Z) - Efficient quantum algorithm to simulate open systems through a single environmental qubit [0.0]
We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers.
Under fixed accuracy conditions, our algorithm enables a reduction in the number of trotter steps compared to other approaches.
arXiv Detail & Related papers (2023-11-16T16:45:30Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling
Limit [55.05109484230879]
We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system.
We generate optimal pulse sequences that implement a CNOT gate with high fidelity.
We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
arXiv Detail & Related papers (2023-06-14T18:24:51Z) - Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity.
We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree.
These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
arXiv Detail & Related papers (2022-01-06T21:02:30Z) - An Optimized Quantum Implementation of ISD on Scalable Quantum Resources [2.274915755738124]
We show that Prange's ISD algorithm can be implemented rather efficiently on a quantum computer.
We leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs.
arXiv Detail & Related papers (2021-12-12T06:01:10Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.