Clifford noise reduction (CliNR) is a partial error correction scheme that reduces the logical error rate of Clifford circuits at the cost of a modest qubit and gate overhead. The CliNR implementation of an
n-qubit Clifford circuit of size
s achieves a vanishing logical error rate if
snp2→0 where
p is the physical error rate. Here, we propose a recursive version of CliNR that can reduce errors on larger circuits with a relatively small gate overhead. When
np→0, the logical error rate can be vanishingly small. This implementation requires
(2⌈log(sp)⌉+3)n+1 qubits and at most $24 s \left\lceil(sp)^4\right\rceil $ gates. Using numerical simulations, we show that the recursive method can offer an advantage in a realistic near-term parameter regime. When circuit sizes are large enough, recursive CliNR can reach a lower logical error rate than the original CliNR with the same gate overhead. The results offer promise for reducing logical errors in large Clifford circuits with relatively small overheads.
In the current era of Noisy Intermediate-Scale Quantum (NISQ) technology, the practical use of quantum computers remains inhibited by our inability to aptly decouple qubits from their environment to mitigate computational errors. In this paper, we introduce an approach by which knowledge of a qubit's initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We benchmark our protocol using cloud-based access to IBM quantum processors. On ibmq_rome, we demonstrate a reduction of the single-qubit error rate by 38%, from [Formula: see text] to [Formula: see text], provided the initial state of the input qubit is known. On ibmq_bogota, we prove that our protocol will never decrease gate fidelity, provided the system's [Formula: see text] and [Formula: see text] times have not drifted above 100 times their assumed values. The protocol can be used to reduce quantum state preparation errors, as well as to improve the fidelity of quantum circuits for which some knowledge of the qubits' intermediate states can be inferred. This paper presents a pathway to using information about noise levels and quantum state distributions to significantly reduce error rates associated with quantum gates via optimized decomposition into native hardware gates.
Abstract Effective circuit partitioning is critical for Noisy Intermediate-Scale Quantum (NISQ) devices, which are hampered by high error rates and limited qubit connectivity. Standard partitioning heuristics often neglect gate-specific error impacts, leading to suboptimal divisions with significant communication overhead and reduced fidelity. This paper introduces Fidelipart , a novel framework that transforms quantum circuits into a fidelity-aware hypergraph. In this model, gate error rates and structural dependencies inform the weights of nodes (gates) and hyperedges (representing multi-qubit interactions and qubit timelines), guiding an Mt-KaHyPar partitioner to minimize cuts through error-prone operations. We evaluated Fidelipart against BQSKit’s QuickPartitioner on 6-qubit/22-gate (‘Circuit S’), 10-qubit/55-gate (‘Circuit M’), and 24-qubit/88-gate (‘Circuit L’) benchmarks under a linear topology with a consistent local contiguous re-mapping strategy. Results demonstrate Fidelipart ’s superior performance. It achieved SWAP gate reductions ranging from 77.3% (Circuit L) to 100% (Circuit S) and up to a 52.2% decrease in cut qubits (Circuit L). These physical improvements directly translated to estimated fidelity gains ranging from 27.3% (Circuit S) to over 254.8% (Circuit M). While Fidelipart showed a modest runtime increase of 8-13% and variable effects on maximum partition depth, its substantial enhancement of circuit fidelity highlights the significant benefits of integrating detailed error-awareness into the partitioning process for more reliable NISQ computations.