Searcharxiv⌕ Search

arXiv subjects

Yunzhe Zheng

Publications and source records attributed to Yunzhe Zheng.

7 recordsLinked to original sources

Fragility of Magic State Distillation under Imperfect Measurements

Magic state distillation (MSD) is the leading approach for producing the non-Clifford resources required for universal fault-tolerant quantum computation. Most prior analyses of MSD assume ideal projective stabilizer measurements, but this assumption becomes questionable on near-term hardware, where measurement fidelity is limited and large quantum error-correcting codes are unavailable. We consider imperfect measurements that are modelled as noisy projector controlled by \textit{measurement strength}, which can be regarded as inverse of measurement noise, and develop a general framework for analyzing MSD under imperfect stabilizer measurements. We focus on MSD protocols that are based on CSS codes with transversal non-Clifford gates, and show that MSD exhibits a measurement-strength threshold that is distinct from the previously known threshold on input-state error. When measurement strength is below a critical threshold, MSD loses its distillation power entirely; When measurement strength is above this threshold, distillation under imperfect measurements remains possible, but the asymptotic target states may deviate from the ideal magic states. In particular, this deviation is at most first-order biased. Moreover, we show that imperfect measurements with finite measurement strength reduces the distillation efficiency to linear, implying exponentially larger distillation overheads than in the ideal-measurement case. We further show that this fragility can be mitigated generally up to the code capacity of MSD protocols by choosing the stabilizer generators to measure in the \textit{standard form}. Our results reveal fundamental constraints imposed by imperfect measurements on MSD and provide guidance for designing more robust distillation protocols in realistic quantum hardware.

quant-ph↗

Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward

Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of quantum gate teleportation protocols that implement non-Clifford gates on arbitrary input states without revealing any information about them; we refer to these protocols as magic gate teleportation (MGT). We uncover a hidden structure within MGT -- after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that useful resource states for MGT, i.e., states that can be used for non-Clifford gates through MGT protocols, are necessarily Clifford-equivalent to diagonal states; in particular, the output state distilled from the $[\![5, 1, 3]\!]$ protocol is not useful for MGT. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.

quant-ph↗

From Magic State Distillation to Dynamical Systems

Magic State Distillation (MSD) has been a research focus for fault-tolerant quantum computing due to the need for non-Clifford resource in gaining quantum advantage. Although many of the MSD protocols so far are based on stabilizer codes with transversal $T$ gates, there exists quite several protocols that don't fall into this class. Here we propose a method to map MSD protocols to iterative dynamical systems under the framework of stabilizer reduction. With the proposed mapping, we are able to analyze the performance of MSD protocols using techniques from dynamical systems theory, easily simulate the distillation process of input states under arbitrary noise and visualize it using flow diagram. We apply our mapping to common MSD protocols for $\ket{T}$ state and find some interesting properties: The $[[15, 1, 3]]$ code may distill states corresponding to $\sqrt{T}$ gate and the $[[5, 1, 3]]$ code can distill the magic state corresponding to the $T$ gate. Besides, we examine the exotic MSD protocols that may distill into other magic states proposed in [Eur. Phys. J. D 70, 55 (2016)] and identify the condition for distillable magic states. We also study new MSD protocols generated by concatenating different codes and numerically demonstrate that concatenation can generate MSD protocols with various magic states. By concatenating efficient codes with exotic codes, we can reduce the overhead of the exotic MSD protocols. We believe our proposed method will be a useful tool for simulating and visualization MSD protocols for canonical MSD protocols on $\ket{T}$ as well as other unexplored MSD protocols for other states.

quant-ph↗

Structure evolution path of ferroelectric hafnium zirconium oxide nanocrystals under in-situ biasing

Fluorite-type $\mathrm{HfO_2}$-based ferroelectric (FE) oxides have rekindled interest in FE memories due to their compatibility with silicon processing and potential for high-density integration. The polarization characteristics of FE devices are governed by the dynamics of metastable domain structure evolution. Insightful design of FE devices for encoding and storage necessitates a comprehensive understanding of the internal structural evolution. Here, we demonstrate the evolution of domain structures through a transient polar orthorhombic (O)-$Pmn2_1$-like configuration via $in$-$situ$ biasing on $\mathrm{TiN/Hf_{0.5}Zr_{0.5}O_2/TiN}$ capacitors within spherical aberration-corrected transmission electron microscope, combined with theoretical calculations. Furthermore, it is directly evidenced that the non-FE O-$Pbca$ transforms into the FE O-$Pca2_1$ phase under electric field, with the polar axis of the FE-phase aligning towards the bias direction through ferroelastic transformation, thereby enhancing FE polarization. As cycling progresses further, however, the polar axis collapses, leading to FE degradation. These novel insights into the intricate structural evolution path under electrical field cycling facilitate optimization and design strategies for $\mathrm{HfO_2}$-based FE memory devices.

cond-mat.mtrl-sci↗

Phase transitions in typical fluorite-type ferroelectrics

While ferroelectric hafnia ($\mathrm{HfO_2}$) has become a technically important material for microelectronics, the physical origin of its ferroelectricity remains poorly understood. The tetragonal $P4_2/nmc$ phase is commonly assigned as its paraelectric mother phase but has no soft mode at the Brillouin zone center. In this work, we propose that the paraelectric-ferroelectric transition in hafnia-like $Pca2_1$ ferroelectric family can be described by a $Pcca$-$Pca2_1$ transition, where the $Pcca$ mother phase will evolve into either the $Pca2_1$ ferroelectric phase or the centrosymmetric $P2_1/c$ monoclinic phase, depending on the strain conditions. The $Pcca$ phase is directly linked to both phases in the context of continuous phase transition. Hafnia is regarded as a special case of this family, in that it has accidental atomic degeneracy because all anions are oxygen. The theory is also correlated to the seven-coordination theory that explains the ferroelectricity in hafnia from a chemical perspective. In addition, the strain conditions to promote the ferroelectric phase in hafnia are discussed.

cond-mat.mtrl-sci↗

Minimizing readout-induced noise for early fault-tolerant quantum computers

Quantum error correcting code can diagnose potential errors and correct them based on measured outcomes by leveraging syndrome measurement. However, mid-circuit measurement has been technically challenging for early fault-tolerant quantum computers and the readout-induced noise acts as a main contributor to the logical infidelity. We present a different method for syndrome extraction, namely Generalized Syndrome Measurement, that requires only a single-shot measurement on a single ancilla, while the canonical syndrome measurement requires multiple measurements to extract the eigenvalue for each stabilizer generator. As such, we can detect the error in the logical state with minimized readout-induced noise. By adopting our method as a pre-check routine for quantum error correcting cycles, we can significantly reduce the readout overhead, the idling time, and the logical error rate during syndrome measurement. We numerically analyze the performance of our protocol using Iceberg code and Steane code under realistic noise parameters based on superconducting hardware and demonstrate the advantage of our protocol in the near-term scenario. As mid-circuit measurements are still error-prone for near-term quantum hardware, our method may boost the applications of early fault-tolerant quantum computing.

quant-ph↗

Entanglement distribution with minimal memory requirements using time-bin photonic qudits

Generating multiple entangled qubit pairs between distributed nodes is a prerequisite for a future quantum internet. To achieve a practicable generation rate, standard protocols based on photonic qubits require multiple long-term quantum memories, which remains a significant experimental challenge. In this paper, we propose a novel protocol based on $2^m$-dimensional time-bin photonic qudits that allow for the simultaneous generation of multiple ($m$) entangled pairs between two distributed qubit registers and outline a specific implementation of the protocol based on cavity-mediated spin-photon interactions. By adopting the qudit protocol, the required qubit memory time is independent of the transmission loss between the nodes in contrast to standard qubit approaches. As such, our protocol can significantly boost the performance of near-term quantum networks.

quant-ph↗