Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.
Overhead for simulating a non-local channel with local channels by quasiprobability sampling
2 Pith papers cite this work, alongside 51 external citations. Polarity classification is still indexing.
2
Pith papers citing it
51
external citations · OpenAlex
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Digital Annealer-assisted transpilation reduces CNOT counts by 13.7% on average (up to 57.4%) versus Qiskit on structured circuits, with a full-DA variant outperforming ISAAQ by 23.1%.
citing papers explorer
-
Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm
Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.
-
Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing
Digital Annealer-assisted transpilation reduces CNOT counts by 13.7% on average (up to 57.4%) versus Qiskit on structured circuits, with a full-DA variant outperforming ISAAQ by 23.1%.