Blind CQEC estimates the target state from noisy data to recover fidelity without a priori knowledge, with a proven Lipschitz bound explaining linear correlation in fidelities and 3.4x error reduction in H2 VQE.
arXiv:2308.06572 (2023)
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Experimental comparison of Shor's and Regev's factoring algorithms on QMIO and IBM quantum computers for N=15, showing differences in noise robustness via one- vs higher-dimensional Fourier sampling.
The authors propose a catalytic coherence-amplification protocol claimed to recover known quantum states from noisy copies without an error threshold, using 8-32 copies in numerical benchmarks.
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.
Simulations across four organic qubit platforms show Petz recovery yields maximum fidelity gain at the entanglement-breaking threshold gamma_c, with Delta F max of 0.303 at dimension 64 and log2 d scaling.
citing papers explorer
-
Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without A Priori Knowledge
Blind CQEC estimates the target state from noisy data to recover fidelity without a priori knowledge, with a proven Lipschitz bound explaining linear correlation in fidelities and 3.4x error reduction in H2 VQE.
-
From Period Finding to Lattice Sampling: Experimental Insights into Shor's and Regev's Factoring Algorithms
Experimental comparison of Shor's and Regev's factoring algorithms on QMIO and IBM quantum computers for N=15, showing differences in noise robustness via one- vs higher-dimensional Fourier sampling.
-
Catalytic Quantum Error Correction: Theory, Efficient Catalyst Preparation, and Numerical Benchmarks
The authors propose a catalytic coherence-amplification protocol claimed to recover known quantum states from noisy copies without an error threshold, using 8-32 copies in numerical benchmarks.
-
Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.
-
The $\gamma_c$-Peak: Covariant Recovery on Four Organic Qubit Platforms
Simulations across four organic qubit platforms show Petz recovery yields maximum fidelity gain at the entanglement-breaking threshold gamma_c, with Delta F max of 0.303 at dimension 64 and log2 d scaling.