Pith. sign in

REVIEW 4 cited by

Quantum Circuit Optimization using Differentiable Programming of Tensor Network States

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.12583 v1 pith:E56NLTRK submitted 2024-08-22 quant-ph

classification quant-ph
keywords quantumoptimizationstatesalgorithmcircuitcircuitsmodelsnetwork
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network methods. The said algorithm runs on classical hardware and finds shallow, accurate quantum circuits by minimizing scalar cost functions. The gradients relevant for the optimization process are computed using the reverse mode automatic differentiation technique implemented on top of the time-evolved block decimation algorithm for matrix product states. A variation of the ADAM optimizer is utilized to perform a gradient descent on the manifolds of charge conserving unitary operators to find the optimal quantum circuit. The efficacy of this approach is demonstrated by finding the ground states of spin chain Hamiltonians for the Ising, three-state Potts and the massive Schwinger models for system sizes up to L=100. The first ten excited states of these models are also obtained for system sizes L=24. All circuits achieve high state fidelities within reasonable CPU time and modest memory requirements.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Resource-efficient quantum-selected configuration interaction for molecular properties

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A heuristic Pauli-term screening cuts QSCI Hamiltonian resources by ~98% and reproduces CASCI energies and dipole moments for Group IIIA monofluorides in simulation and on 20-qubit IBM hardware.

  2. Optimizing Quantum Photonic Integrated Circuits using Differentiable Tensor Networks

    quant-ph 2025-09 unverdicted novelty 6.0 of 10

    Gradient-based optimization of quantum photonic circuits is achieved via differentiable tensor networks that model nonlinear unitary gates and stochastic losses at low photon numbers.

  3. Resource-Efficient Simulations of Particle Scattering on a Digital Quantum Computer

    quant-ph 2025-07 conditional novelty 6.0 of 10

    A hybrid tensor-network plus quantum-hardware pipeline simulates Thirring-model fermion scattering on 40 qubits and prepares wave packets on 80 qubits with a 3.2x circuit depth reduction.

  4. High-Performance Contraction of Quantum Circuits for Riemannian Optimization

    quant-ph 2025-06 conditional novelty 5.0 of 10

    A matrix-free, cached Hessian framework enables memory-efficient Riemannian trust-region optimization of quantum circuit gates, with near-linear parallel speedup up to 112 threads.

Pith tools