Pi-QEM selects dominant low-weight Pauli strings for ML training in quantum error mitigation, reducing ground-state energy estimation error by up to 34.01% using a single observable in molecular simulations on noisy IBM backends.
Gottesman, Theory of fault-tolerant quantum compu- tation, Physical Review A57, 127 (1998)
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
In-patch multiplexing reduces expected attempts per accepted logical magic state by 45-79% at physical error rate 2e-3 for distances 3 and 5 while leaving the escape stage unchanged.
A new scheme for fault-tolerant quantum computation on qLDPC codes achieves constant qubit overhead and time overhead O(d^{1+o(1)}) for good codes, faster than prior code surgery methods for a<2.
Within a restricted low-energy spin-sector ansatz for n-p scattering, direction-averaged magic is locally minimized at the CP-conserving point heta-bar=0 when the effective phase equals heta/4 or lies in specific windows.
citing papers explorer
-
Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation
Pi-QEM selects dominant low-weight Pauli strings for ML training in quantum error mitigation, reducing ground-state energy estimation error by up to 34.01% using a single observable in molecular simulations on noisy IBM backends.
-
Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder
An FPGA-based neural-network decoder achieves 550 ns deterministic closed-loop latency for real-time distance-3 surface code error correction on a superconducting processor, matching offline decoding performance.
-
Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing
In-patch multiplexing reduces expected attempts per accepted logical magic state by 45-79% at physical error rate 2e-3 for distances 3 and 5 while leaving the escape stage unchanged.
-
Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
A new scheme for fault-tolerant quantum computation on qLDPC codes achieves constant qubit overhead and time overhead O(d^{1+o(1)}) for good codes, faster than prior code surgery methods for a<2.
-
Local Minimum of Spin-Sector Magic at the CP-Conserving Point in Low-Energy Neutron-Proton Scattering
Within a restricted low-energy spin-sector ansatz for n-p scattering, direction-averaged magic is locally minimized at the CP-conserving point heta-bar=0 when the effective phase equals heta/4 or lies in specific windows.