Logical CCZ states enable Toffoli gates, a central building block of fault-tolerant quantum arithmetic. We introduce an end-to-end protocol for direct CCZ-state preparation on bivariate tricycle and bicycle (BT/BB) codes. Our factory combines the cup-product CCZ gates native to BT codes with two novel ingredients, both enabled by engineering the logical coupling between BT and BB codes through projection-preserving lifts. Index-2 lifted BB ancillas enable selective $Z$-basis initialization, allowing the native cup-product gates to directly prepare two disjoint logical CCZ states. The prepared CCZ states are faithfully transferred to index-3 lifted BB memories with high code distance. We use decoder-based postselection to obtain high-fidelity output states with low overhead. We perform exact simulations of our factory under a circuit-level noise model motivated by neutral-atom hardware, obtaining joint infidelities of $1.84\times10^{-5}$ at $21.94\%$ acceptance and $4.10\times10^{-7}$ at $8.89\%$ acceptance for single-qubit, CZ, and CCZ error rates of $0.01\%$, $0.1\%$, and $0.5\%$, respectively. At the output-infidelity target of our smallest factory, its estimated spacetime cost per CCZ state is lower than that of $T$-state cultivation followed by CCZ conversion, providing an efficient route to logical CCZ states for fault-tolerant quantum computation.
Constant-depth magic state cultivation with Clifford measurements by gauging
IBM Quantum, IBM T. J. Watson Research Center(IBM量子,IBM托马斯·J·沃森研究中心);IBM Denmark(IBM丹麦);University of Sydney(悉尼大学);IBM Almaden Research Center(IBM阿尔马登研究中心)
Graduate School of Engineering Science, Osaka University(大阪大学工学研究科);Graduate School of Informatics, Kyoto University(京都大学信息学研究科);Quantum Laboratory, Fujitsu Research, Fujitsu Limited(富士通研究院量子实验室);Nanofiber Quantum Technologies, Inc. (NanoQT)(纳米纤维量子技术股份有限公司(NanoQT));Fujitsu Quantum Computing Joint Research Division, Center for Quantum Information and Quantum Biology, Osaka University(大阪大学量子信息与量子生物学中心富士通量子计算联合研究部);RIKEN Center for Quantum Computing (RQC)(理化学研究所量子计算中心)
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Universität Innsbruck(因斯布鲁克大学);Technische Universität Wien(维也纳工业大学);Institute for Theoretical Physics, University of Innsbruck(因斯布鲁克大学理论物理研究所);neQxt GmbH(neQxt有限公司);Alpine Quantum Technologies GmbH(阿尔卑斯量子技术有限公司)
Efficient magic state cultivation with lattice surgery
The University of Osaka(大阪大学);Fujitsu Research, Fujitsu Limited(富士通研究所);Center for Quantum Information and Quantum Biology, The University of Osaka(大阪大学量子信息与量子生物学中心);RIKEN Center for Quantum Computing (RQC)(理化学研究所量子计算中心)
A Resource Comparison of Logical T-State Preparation
School of Physics, Peking University(北京大学物理学院);Center on Frontiers of Computing Studies, School of Computer Science, Peking University(北京大学计算机科学学院前沿计算研究中心)
Comparing magic state cultivation methods using matrix product states
QPerfect SAS;European Center for Quantum Sciences(欧洲量子科学中心);University of Strasbourg and CNRS, CESQ and ISIS (UMR 7006)(斯特拉斯堡大学与法国国家科学研究中心,CESQ和ISIS(联合研究单位7006))
Transversal dimension jump for product qLDPC codes
Institute for Quantum Information and Matter, Caltech(加州理工学院量子信息与物质研究所);Fu Foundation School of Engineering and Applied Science, Columbia University(哥伦比亚大学富工程与应用科学学院);AWS Center for Quantum Computing(亚马逊量子计算中心);Walter Burke Institute for Theoretical Physics, Caltech(加州理工学院沃尔特·伯克理论物理研究所)
Suppressing errors in analog logical rotation gates via balanced fusion
NVIDIA Corporation(英伟达公司);AWS Center for Quantum Computing(亚马逊量子计算中心);Institute for Quantum Information and Matter, California Institute of Technology(加州理工学院量子信息与物质研究所)
SOFT: a high-performance simulator for universal fault-tolerant quantum circuits
Institute of Software, Chinese Academy of Sciences(中国科学院软件研究所);The University of Hong Kong(香港大学);Arclight Quantum Corporation(Arclight量子公司);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所)
Batched high-rate logical operations for quantum LDPC codes
Institute for Quantum Information and Matter, Caltech(加州理工学院量子信息物质研究所);Walter Burke Institute for Theoretical Physics, Caltech(加州理工学院沃尔特·伯克理论物理研究所);QuEra Computing Inc.(QuEra计算公司);Department of Physics, Harvard University(哈佛大学物理系);AWS Center for Quantum Computing(亚马逊云科技量子计算中心);Massachusetts Institute of Technology(麻省理工学院)
Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
Nanofiber Quantum Technologies, Inc. (NanoQT)(纳米纤维量子技术有限公司);Clarendon Laboratory, University of Oxford(牛津大学克拉伦登实验室);Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo(东京大学大学院信息理工学研究系计算机科学专业)
Decoder Model Compatibility Provides Information beyond the Logical Gap under Drifting and Correlated Quantum Noise
University of Washington(华盛顿大学);Pacific Northwest National Laboratory(太平洋西北国家实验室);Fordham University(福特汉姆大学);Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);NASA Ames Research Center(美国宇航局艾姆斯研究中心)
Single-Shot Universality in Quantum LDPC Codes via Code-Switching
Joint Center for Quantum Information and Computer Science, University of Maryland and NIST(马里兰大学与国家标准技术研究院联合量子信息与计算科学中心);Joint Quantum Institute, University of Maryland and NIST(马里兰大学与国家标准技术研究院联合量子研究所);University of California San Diego(加州大学圣地亚哥分校);Hon Hai Research Institute(鸿海研究院)
Efficient fidelity simulation of high-rate magic distillation circuits
QuEra Computing Inc.(QuEra 计算公司);Joint Center for Quantum Information and Computer Science, University of Maryland(马里兰大学量子信息与计算机科学联合中心);Simons Institute for the Theory of Computing, University of California at Berkeley(加州大学伯克利分校西蒙斯计算理论研究所);Institute for Theoretical Physics, ETH Zürich(苏黎世联邦理工学院理论物理研究所);Department of Physics, Harvard University(哈佛大学物理学系)
A topological theory for qLDPC: non-Clifford gates and magic state fountain on homological product codes with constant rate and beyond the $N^{1/3}$ distance barrier
IBM Quantum, T.J. Watson Research Center(IBM量子,T.J.沃森研究中心)