Evidence map›Paper›PMID 39766687›Full record

ArticleEntropy (Basel, Switzerland)2024

Contraction Heuristics for Tensor Decision Diagrams.

Christian Bøgh Larsen, Simon Brun Olsen, Kim Guldstrand Larsen, Christian Schilling

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Advances in Quantum Computation in NISQ Era.Entropy (Basel, Switzerland) · 2025
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Christian Bøgh LarsenDepartment of Computer Science, Aalborg University, 9220 Aalborg, Denmark.
Simon Brun OlsenDepartment of Computer Science, Aalborg University, 9220 Aalborg, Denmark.
Kim Guldstrand LarsenDepartment of Computer Science, Aalborg University, 9220 Aalborg, Denmark.ORCID 0000-0002-5953-3384
Christian SchillingDepartment of Computer Science, Aalborg University, 9220 Aalborg, Denmark.ORCID 0000-0003-3658-1065

Funding

Danmarks Frie Forskningsfond 10.46540/3120-00041BInnovation Fund Denmark 9142-0001BVillum Fonden 37819
6 · The paper itself

Abstract

In this paper, we study the equivalence problem for quantum circuits: Given two quantum circuits, are they equivalent? We reduce this problem to the contraction problem of a tensor network. The order in which the contraction operations between tensors are applied has a crucial impact on efficiency, which is why many heuristics have been proposed. In this work, we use an efficient representation of tensors as a tensor decision diagram. Since existing contraction heuristics do not perform well in combination with these diagrams, we propose two new contraction heuristics. We demonstrate experimentally that our heuristics outperform other state-of-the-art heuristics. We also demonstrate that our framework yields state-of-the-art performance for equivalence checking.

Indexed as

contraction planningequivalence checkingheuristicsquantum circuittensor decision diagramtensor network

Identifiers

PMID39766687
PMCPMC11675637

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.