Pith. sign in

REVIEW 1 cited by

Simulating Hamiltonian dynamics in a programmable photonic quantum processor using linear combinations of unitary operations

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 2211.06723 v1 pith:EWL3W27M submitted 2022-11-12 quant-ph

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

Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki approximation algorithm, also well known as the Trotterization, is a basic algorithm in quantum dynamic simulation. A multi-product algorithm that is a linear combination of multiple Trotterizations has been proposed to improve the approximation accuracy. Implementing such multi-product Trotterization in quantum computers however remains experimentally challenging and its success probability is limited. Here, we modify the multi-product Trotterization and combine it with the oblivious amplitude amplification to simultaneously reach a high simulation precision and high success probability. We experimentally implement the modified multi-product algorithm in an integrated-photonics programmable quantum simulator in silicon, which allows the initialization, manipulation and measurement of four-qubit states and a sequence of linearly combined controlled-unitary gates, to emulate the dynamics of a coupled electron and nuclear spins system. Theoretical and experimental results are in good agreement, and they both show the modified multi-product algorithm can simulate Hamiltonian dynamics with a higher precision than conventional Trotterizations and a nearly deterministic success probability. We certificate the multi-product algorithm in a small-scale quantum simulator based on linear combinations of operations, and this work promises the practical implementations of quantum dynamics simulations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Transition-aware decomposition of single-qudit gates

    quant-ph 2025-10 conditional novelty 6.0 of 10

    For any connected selection-rule graph, any single-qudit unitary decomposes into at most d(d−1)/2 allowed two-level pulses via a BFS-based QR-style algorithm.

Pith tools