Pith. sign in

Title resolution pending

Zhongchu Ni, Sai Li, Xiaowei Deng, Yanyan Cai, Libo Zhang, Weiting Wang, Zhen-Biao Yang, Haifeng Yu, Fei Yan, Song Liu, Chang-Ling Zou, Luyan Sun, Shi-Biao Zheng, Yuan Xu, Dapeng Yu · 2023 · Nature · DOI 10.1038/s41586-023-05784-4

1 Pith paper cite this work, alongside 180 external citations. Polarity classification is still indexing.

1 Pith paper citing it
180 external citations · OpenAlex
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

quant-ph 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Toward Minimum Graphic Parity Networks

quant-ph · 2025-09-12 · conditional · novelty 7.0

The minimum size of a graphic parity network for a connected graph is at least m+n-1, rising to m+Omega(n^1.5) for graphs with no short cycles, and a randomized construction achieves m+O(n^1.5 sqrt(log n)).

citing papers explorer

Showing 1 of 1 citing paper.

  • Toward Minimum Graphic Parity Networks quant-ph · 2025-09-12 · conditional · none · ref 25

    The minimum size of a graphic parity network for a connected graph is at least m+n-1, rising to m+Omega(n^1.5) for graphs with no short cycles, and a randomized construction achieves m+O(n^1.5 sqrt(log n)).