arXiv subjects

Dawei Zhong

Publications and source records attributed to Dawei Zhong.

6 recordsLinked to original sources

arXiv2026

Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code

Code-switching offers a route to universal, fault-tolerant quantum computation by circumventing the limitation implied by the Eastin-Knill theorem against a universal transversal gate set within a single quantum code. Here, we present a fault-tolerant code-switching protocol between two versions of the $[[8, 3, 2]]$ code. One version supports weakly fault-tolerant single-qubit Clifford gates, while the other supports a logical $\overline{\mathrm{CCZ}}$ gate via transversal $T/T^\dagger$ together with logical $\overline{\mathrm{CZ}}$, $\overline{\mathrm{CNOT}}$, and $\overline{\mathrm{SWAP}}$ gates. Because both codes have distance 2, the protocol operates in a postselected, error-detecting regime: single faults lead to detectable outcomes, and accepted runs exhibit quadratic suppression of logical error rates. This yields a universal scheme for postselected fault-tolerant computation. We validate the protocol numerically through simulations of state preparation, code switching, and a three-logical-qubit implementation of Grover's search.

quant-ph↗

arXiv2026

Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era

Quantum error correction offers a promising path to suppress errors in quantum processors, but the resources required to protect logical operations from noise, especially non-Clifford operations, pose a substantial challenge to achieve practical quantum advantage in the early fault-tolerant quantum computing (EFTQC) era. In this work, we develop a systematic scheme to encode exponential maps of the form $\exp(-i\theta P)$ into stabilizer codes with simple circuit structures and low qubit overhead. We provide encoded circuits with small first-order logical error rate after postselection for the [[n, n-2, 2]] quantum error-detecting codes and the [[5, 1, 3]], [[7, 1, 3]], and [[15, 7, 3]] quantum error-correcting codes. Detailed analysis shows that under the level of physical noise of current devices, our encoding scheme is 4--7 times less noisy than the unencoded operation, while at most 3% of runs need to be discarded.

quant-ph↗

arXiv2025

Combining Error Detection and Mitigation: A Hybrid Protocol for Near-Term Quantum Simulation

Practical implementation of quantum error correction is currently limited by near-term quantum hardware. In contrast, quantum error mitigation has demonstrated strong promise for improving the performance of noisy quantum circuits without the requirement of full fault tolerance. In this work, we develop a hybrid error suppression protocol that integrates Pauli twirling, probabilistic error cancellation, and the $[[n, n-2, 2]]$ quantum error detecting code. In addition, to reduce overhead from error mitigation components of our method, we modify Pauli twirling by lowering the number of Pauli operators in the twirling set, and apply probabilistic error cancellation at the end of the encoded circuit to remove undetectable errors. Finally, we demonstrate our protocol on a non-Clifford variational quantum eigensolver circuit that estimates the ground state energy of $\rm H_2$ using both \texttt{qiskit} AerSimulator and the IBM quantum processor \texttt{ibm\_brussels}.

quant-ph↗

arXiv2024

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics and computer science are typically very hard to tackle in classical computing and quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat the problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. We develop a new method, called ITE-BE, based on a recent imaginary time algorithm, which requires no variational parameter optimization as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the post-selection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block encoding scheme to allow for a deterministic application of the first layer of the circuit.

quant-ph↗

arXiv2021

RobustFusion: Robust Volumetric Performance Reconstruction under Human-object Interactions from Monocular RGBD Stream

High-quality 4D reconstruction of human performance with complex interactions to various objects is essential in real-world scenarios, which enables numerous immersive VR/AR applications. However, recent advances still fail to provide reliable performance reconstruction, suffering from challenging interaction patterns and severe occlusions, especially for the monocular setting. To fill this gap, in this paper, we propose RobustFusion, a robust volumetric performance reconstruction system for human-object interaction scenarios using only a single RGBD sensor, which combines various data-driven visual and interaction cues to handle the complex interaction patterns and severe occlusions. We propose a semantic-aware scene decoupling scheme to model the occlusions explicitly, with a segmentation refinement and robust object tracking to prevent disentanglement uncertainty and maintain temporal consistency. We further introduce a robust performance capture scheme with the aid of various data-driven cues, which not only enables re-initialization ability, but also models the complex human-object interaction patterns in a data-driven manner. To this end, we introduce a spatial relation prior to prevent implausible intersections, as well as data-driven interaction cues to maintain natural motions, especially for those regions under severe human-object occlusions. We also adopt an adaptive fusion scheme for temporally coherent human-object reconstruction with occlusion analysis and human parsing cue. Extensive experiments demonstrate the effectiveness of our approach to achieve high-quality 4D human performance reconstruction under complex human-object interactions whilst still maintaining the lightweight monocular setting.

cs.CV↗

arXiv2020

Entering the Era of Dark Matter Astronomy? Near to Long-Term Forecasts in X-Ray and Gamma-Ray Bands

We assess Galactic Dark Matter (DM) sensitivities to photons from annihilation and decay using the spatial and kinematic information determined by state-of-the-art simulations in the Latte suite of Feedback In Realistic Environments (FIRE-2). For kinematic information, we study the energy shift pattern of DM narrow emission lines predicted in FIRE-2 and discuss its potential as DM-signal diagnosis, showing for the first time the power of symmetric observations around $l=0^{\circ}$. We find that the exposures needed to resolve the line separation of DM to gas by XRISM at $5σ$ to be large, $\gtrsim 4$ Ms, while exposures are smaller for Athena ($\lesssim 50$ ks) and Lynx ($\lesssim 100$ ks). We find that large field-of-view exposures remain the most sensitive methods for detection of DM annihilation or decay by the luminosity of signals in the field of view dominating velocity information. The $\sim$4 sr view of the Galactic Center region by the Wide Field Monitor (WFM) aboard the eXTP mission will be highly sensitive to DM signals, with a prospect of $\sim 10^5$ to $10^6$ events from the 3.5 keV line in a 100 ks exposure, with the range dependent on photon acceptance in WFM's field of view. We also investigate detailed all-sky luminosity maps for both DM annihilation and decay signals - evaluating the signal-to-noise for a DM detection with realistic X-ray and gamma-ray backgrounds - as a guideline for what could be a forthcoming era of DM astronomy.

astro-ph.HE↗