Compact Circuits for Constrained Quantum Evolutions of Sparse Operators

• URL: http://arxiv.org/abs/2504.09133v1
• Date: Sat, 12 Apr 2025 08:47:59 GMT
• Title: Compact Circuits for Constrained Quantum Evolutions of Sparse Operators
• Authors: Franz G. Fuchs, Ruben P. Bassa,
• Abstract summary: We introduce a general framework for constructing compact quantum circuits that implement the real-time evolution of Hamiltonians of the form $H = sigma P_B$.<n>Such Hamiltonians frequently arise in quantum algorithms, including constrained mixers in QAOA, fermionic and excitation operators in VQE, and lattice gauge theory applications.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a general framework for constructing compact quantum circuits that implement the real-time evolution of Hamiltonians of the form $H = \sigma P_B$, where $\sigma$ is a Pauli string commuting with a projection operator $P_B$ onto a subspace of the computational basis. Such Hamiltonians frequently arise in quantum algorithms, including constrained mixers in QAOA, fermionic and excitation operators in VQE, and lattice gauge theory applications. Our method emphasizes the minimization of non-transversal gates, particularly T-gates, critical for fault-tolerant quantum computing. We construct circuits requiring $\mathcal{O}(n|B|)$ CX gates and $\mathcal{O}{n |B| + \log(|B|) \log (1/\epsilon)}$ T-gates, where $n$ is the number of qubits, $|B|$ the dimension of the projected subspace, and $\epsilon$ the desired approximation precision. For group-generated subspaces, we further reduce complexity to $\mathcal{O}(n \log |B|)$ CX gates and $\mathcal{O}{n+\log(\frac{1}{\epsilon})}$ T gates. Our constructive proofs yield explicit algorithms and include several applications, such as improved transposition circuits, efficient implementations of fermionic excitations, and oracle operators for combinatorial optimization.

Related papers

• Quantum oracles for the finite element method [45.200826131319815]
  This study examines the quantum routines required for the implementation of oracles used in the block-encoding of the $N times N stiffness and mass matrices. We show how to construct the necessary oracles, which require the calculation of element geometry, square root and the implementation of conditional operations.
  arXiv  Detail & Related papers  (2025-04-28T14:28:31Z)
• Non-Iterative Disentangled Unitary Coupled-Cluster based on Lie-algebraic structure [0.0]
  Fixed Unitary Coupled-Cluster (UCC) ans"atze are attractive for performing quantum chemistry Variational Quantumsolver (VQE) computations.<n>We introduce $k$-NI-DUCC, a fixed and Non-iterative Disentangled Unitary Coupled-Cluster compact ansatz.
  arXiv  Detail & Related papers  (2024-08-26T14:19:53Z)
• Quantum encoder for fixed Hamming-weight subspaces [0.0]
  We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex data vectors of $d=binomnk$valued into a subspace of fixed Hamming weight $k$. We show how our encoder can improve the performance of variational quantum algorithms for problems that include particle-string symmetries. Our results constitute a versatile framework for quantum data compression with various potential applications in fields such as quantum chemistry, quantum machine learning, and constrained $k$ optimizations.
  arXiv  Detail & Related papers  (2024-05-30T18:26:41Z)
• Hamiltonian simulation for low-energy states with optimal time dependence [45.02537589779136]
  We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. We present a quantum algorithm that uses $O(tsqrtlambdaGamma + sqrtlambda/Gammalog (1/epsilon))$ queries to the block-encoding for any $Gamma$.
  arXiv  Detail & Related papers  (2024-04-04T17:58:01Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Calculable lower bounds on the efficiency of universal sets of quantum gates [0.0]
  Currently available quantum computers, so called Noisy Intermediate-Scale Quantum (NISQ) devices, are characterized by relatively low number of qubits and moderate gate fidelities. In this paper we derive lower bounds on $mathrmgap_r(mathcalS)$ and, as a consequence, on the efficiency of universal sets of $d$-dimensional quantum gates.
  arXiv  Detail & Related papers  (2022-01-27T19:38:13Z)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49:44Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Trading T gates for dirty qubits in state preparation and unitary synthesis [0.0]
  We present a quantum algorithm for preparing any dimension-$N$ pure quantum state specified by a list of $N$ classical numbers. Our scheme uses $mathcalO(fracNlambda+lambdalogfracNepsilonlogfraclogNepsilon)$ to reduce the T-gate cost to $mathcalO(fracNlambda+lambdalogfracNepsilonlogfraclogNepsilon)$
  arXiv  Detail & Related papers  (2018-12-03T18:24:32Z)

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.