Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation

• URL: http://arxiv.org/abs/2509.05404v2
• Date: Wed, 24 Sep 2025 13:04:56 GMT
• Title: Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation
• Authors: Thierry N. Kaldenbach, Isaac D. Smith, Hendrik Poulsen Nautrup, Matthias Heller, Hans J. Briegel,
• Abstract summary: We extend previous studies on algorithm-tailored graph states to periodic sequences of generalized Pauli rotations.<n>We derive a novel scheme for the preparation of resource states based on a graph state and a ladder of CNOT gates.<n>We also deploy our two approaches to derive universal resource states from minimal universal sets of generating Hamiltonians.
• Score: 0.3541849852479175
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The direct compilation of algorithm-specific graph states in measurement-based quantum computation (MBQC) can lead to resource reductions in terms of circuit depth, entangling gates, and even the number of physical qubits. In this work, we extend previous studies on algorithm-tailored graph states to periodic sequences of generalized Pauli rotations, which commonly appear in, e.g., Trotterized Hamiltonian simulation. We first implement an enhanced simulated-annealing-based algorithm to find optimal periodic graph states within local-Clifford equivalent MBQC resources. In addition, we derive a novel scheme for the preparation of resource states based on a graph state and a ladder of CNOT gates, which we term anticommutation-based MBQC, since it uncovers a direct relationship between the graph state and the anticommutation matrix for the set of Hamiltonians generating the computation. We also deploy our two approaches to derive universal resource states from minimal universal sets of generating Hamiltonians. Finally, we demonstrate and compare both of our methods based on various examples from condensed matter physics and universal quantum computation.

Related papers

• Quantum Simulation of Coupled Harmonic Oscillators: From Theory to Implementation [0.0]
  We bridge the gap between theory and implementation by developing and comparing three concrete realizations of the algorithm.<n>First, we implement a sparse initial state preparation combined with product-formula ( Suzuki-Trotter) Hamiltonian simulation.<n>Second, we implement a fully quantum, oracle-based framework in which classical data are accessed via oracles.<n>Third, we propose an efficient alternative that combines the sparse state-preparation routine of the first approach with the oracle and block-encoding-based simulation pipeline of the second.
  arXiv  Detail & Related papers  (2026-03-05T18:49:13Z)
• Revisiting the Role of State Texture in Gate Identification and Fixed-Point Resource Theories [40.119993515374325]
  We revisit a protocol for identifying controlled-NOT gates versus single-qubit-only gates in quantum circuits.<n>We show that a more general fidelity-based formulation succeeds for nearly all laboratory bases.<n>We introduce a family of "fixed-point resource theories" that includes fixed-point instances of the theories of state texture, genuine coherence, purity, and athermality.
  arXiv  Detail & Related papers  (2026-02-26T00:22:58Z)
• Improving Generalization and Trainability of Quantum Eigensolvers via Graph Neural Encoding [0.5013248430919223]
  Ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and optimization.<n>We propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network.<n>We demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance.
  arXiv  Detail & Related papers  (2026-02-23T12:01:14Z)
• Performance of Variational Algorithms for Local Hamiltonian Problems on Random Regular Graphs [0.13654846342364307]
  We design two variational algorithms to optimize specific 2-local Hamiltonians defined on graphs.<n>We develop formulae to analyze the energy achieved by these algorithms with high probability over random regular graphs in the infinite-size limit.<n>We show that with just five layers of our algorithm, we can already prepare states within 1.62% error of the ground state energy for QMC on an infinite 1D ring.
  arXiv  Detail & Related papers  (2024-12-19T18:27:39Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Graphix: optimizing and simulating measurement-based quantum computation on local-Clifford decorated graph [0.0]
  We introduce an open-source software library Graphix, which optimize and simulates measurement-based quantum computation (MBQC) By combining the measurement calculus with an efficient graph state simulator, Graphix allows the classical preprocessing of Pauli measurements in the measurement patterns.
  arXiv  Detail & Related papers  (2022-12-22T18:58:20Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
  We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system. Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
  arXiv  Detail & Related papers  (2022-10-16T05:57:43Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices [3.1952399274829775]
  We develop a tool called quantum eigenvalue transformation of unitary matrices with reals (QET-U) This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model.
  arXiv  Detail & Related papers  (2022-04-12T17:11:40Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06: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.