Dense network coding computes group operations over multiaccess networks with half the classical communication cost using shared entanglement plus quantum channels, and yields measurement-device-independent quantum key growing.
Quantum computations: algorithms and error cor- rection
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
fields
quant-ph 6representative citing papers
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
Gaussian randomized rounding on two-qubit marginals of depth-D circuits with local depolarizing noise p yields samples whose expected Max-Cut cost matches the noisy quantum device up to an approximation ratio of 1-O[(1-p)^D].
An integrated compilation and data-driven QED framework raises algorithmic success probability by up to 68% over SABRE on an 8-qubit VQE instance in simulations.
citing papers explorer
-
Communication Advantages from Quantum Dense Network Coding
Dense network coding computes group operations over multiaccess networks with half the classical communication cost using shared entanglement plus quantum channels, and yields measurement-device-independent quantum key growing.
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
-
Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
-
Sampling (noisy) quantum circuits through randomized rounding
Gaussian randomized rounding on two-qubit marginals of depth-D circuits with local depolarizing noise p yields samples whose expected Max-Cut cost matches the noisy quantum device up to an approximation ratio of 1-O[(1-p)^D].
-
Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems
An integrated compilation and data-driven QED framework raises algorithmic success probability by up to 68% over SABRE on an 8-qubit VQE instance in simulations.