检索结果-内蒙古大学图书馆

surface code model for Fibonacci helical pathways of the Orch OR microtubule

BIOSYSTEMS 2025年 249卷 105414页

作者： An, Seungju Choi, Byung-Soo Pukyong Natl Univ Dept Phys 45 Yongso Ro Busan 48513 South Korea Pukyong Natl Univ Dept Sci Comp 45 Yongso Ro Busan 48513 South Korea

The Objective Reduction (OR) theory suggested by Sir Roger Penrose presented a novel perspective on the measurement problem of quantum mechanics and consciousness. Subsequently, based on the assertion of anesthesiologist Dr. Hameroff, the theory proposed that the phenomenon of OR could also manifest in microtubules within neurons. This would, serve as the trigger for consciousness, thereby forming the basis of Orchestrated OR (Orch OR). The peculiarity of this theory lies in the claim that tubulin and its higher neuronal information structures are not simply additive, rather, they are formed in a topological manner. Specifically, higher information structure of tubulin, helical pathways are presumed to form an intersecting pattern in both left-handed and right-handed directions, following a repeating Fibonacci series (3, 5, 8, 13, ... ), and are interconnected with each other. There have been attempts to examine these unique characteristics. However, experimenting upon these quantum characteristics in the microtubule appears to be plagued by certain limitations. Therefore, this study proposed a surface code model to implement this biological model on a quantum computer, focusing on its quantum properties. To the best of our knowledge, this is the first study to attempt this. The study emphasizes that interpreting asymmetric Fibonacci helical pathways as logical qubits can stabilize surface code. In addition, we analyzed the conditions required for experimenting with this model based on the development of current quantum computer. Although the experimental feasibility of this study is dependents on future quantum computer development, it provides significant insights into Orch OR research by offering a novel perspective.

关键词： Objective reduction Orchestrated OR Tubulin Helical pathway Microtubule Quantum computation surface code Consciousness

来源：评论

学校读者我要写书评

暂无评论

Global receptive field transformer decoder method on quantum surface code data and syndrome error correction

引用

Chinese Physics B 2025年第3期34卷 267-276页

作者： Ao-Qing Li Ce-Wen Tian Xiao-Xuan Xu Hong-Yang Ma Jun-Qing Liang School of Information and Control Engineering Qingdao University of TechnologyQingdao 266033China School of Sciences Qingdao University of TechnologyQingdao 266033China

Quantum computing has the potential to solve complex problems that are inefficiently handled by classical ***,the high sensitivity of qubits to environmental interference and the high error rates in current quantum devices exceed the error correction thresholds required for effective algorithm ***,quantum error correction technology is crucial to achieving reliable quantum *** this work,we study a topological surface code with a two-dimensional lattice structure that protects quantum information by introducing redundancy across multiple qubits and using syndrome qubits to detect and correct ***,errors can occur not only in data qubits but also in syndrome qubits,and different types of errors may generate the same syndromes,complicating the decoding task and creating a need for more efficient decoding *** address this challenge,we used a transformer decoder based on an attention *** mapping the surface code lattice,the decoder performs a self-attention process on all input syndromes,thereby obtaining a global receptive *** performance of the decoder was evaluated under a phenomenological error *** results demonstrate that the decoder achieved a decoding accuracy of 93.8%.Additionally,we obtained decoding thresholds of 5%and 6.05%at maximum code distances of 7 and 9,*** results indicate that the decoder used demonstrates a certain capability in correcting noise errors in surface codes.

关键词： quantum error correction surface code transformer decoder

来源：评论

学校读者我要写书评

暂无评论

Optimal execution of logical Hadamard with low-space overhead in rotated surface code

引用

ETRI JOURNAL 2024年第5期46卷 759-773页

作者： Lee, Sang-Min Jin, Ki-Sung Oh, Soo-Cheol On, Jin-Ho Cha, Gyu-Il Elect & Telecommun Res Inst Future Comp Res Div Daejeon South Korea

Fault-tolerant quantum computation requires error-correcting codes that enable reliable universal quantum operations. This study introduces a novel approach that executes the logical Hadamard with low-space requirements while preserving the original definition of logical operators within the framework of the rotated surface codes. Our method leverages a boundary deformation method to rotate the logical qubit transformed by transversal Hadamard. Following this, the original encoding of the logical qubit is reinstated through logical flip-and-shift operations. The estimated space-time cost for a logical Hadamard operation with a code distance d is 5d2 + 3d2. The efficiency enhancement of the proposed method is approximately four times greater than those of previous approaches, regardless of the code distance. Unlike the traditional method, implementing a logical Hadamard requires only two patches instead of seven. Furthermore, the proposed method ensures the parallelism of quantum circuits by preventing interferences between adjacent logical data qubits.

关键词： lattice surgery logical Hadamard quantum circuit quantum error correction code surface code

来源：评论

学校读者我要写书评

暂无评论

Hardness of Braided Quantum Circuit Optimization in the surface code

IEEE TRANSACTIONS ON QUANTUM ENGINEERING

引用

IEEE TRANSACTIONS ON QUANTUM ENGINEERING 2023年第1期4卷 1页

作者： Wasa, Kunihiro Nishio, Shin Suetsugu, Koki Hanks, Michael Stephens, Ashley Yokoi, Yu Nemoto, Kae Hosei Univ Fac Sci & Engn Tokyo 1848584 Japan Natl Inst Informat Tokyo 1018430 Japan Grad Univ Adv Studies SOKENDAI Sch Multidisciplinary Sci Dept Informat Tokyo 1018430 Japan Grad Univ Okinawa Inst Sci & Technol Quantum Informat Sci & Technol Unit Okinawa 9040495 Japan Imperial Coll London Blackett Lab QOLS London SW7 2AZ England

Large-scale quantum information processing requires the use of quantum error-correcting codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates, as they can be implemented using only local interactions in a 2-D array of physical qubits. Procedures, such as defect braiding and lattice surgery, can then be used to realize a fault-tolerant universal set of gates on the logical space of such topological codes. However, error correction also introduces a significant overhead in computation time, the number of physical qubits, and the number of physical gates. While optimizing fault-tolerant circuits to minimize this overhead is critical, the computational complexity of such optimization problems remains unknown. This ambiguity leaves room for doubt surrounding the most effective methods for compiling fault-tolerant circuits for a large-scale quantum computer. In this article, we show that the optimization of a special subset of braided quantum circuits is NP-hard by a polynomial-time reduction of the optimization problem into a specific problem called PlanarRectilinear3SAT.

关键词： Logic gates Qubit Optimization Quantum circuit Lattices Fault tolerant systems Fault tolerance Braiding circuits computational complexity fault-tolerant quantum computation (FTQC) NP-complete PlanarRectilinear3SAT quantum circuit optimization surface code

来源：评论

学校读者我要写书评

暂无评论

Ecmas: Efficient Circuit Mapping and Scheduling for surface code 24

Ecmas: Efficient Circuit Mapping and Scheduling for Surface ...

引用

22nd IEEE/ACM International Symposium on code Generation and Optimization (CGO)

作者： Zhu, Mingzheng Fu, Hao Wu, Jun Zhang, Chi Xie, Wei Li, Xiang-Yang Univ Sci & Technol China Hefei Peoples R China Univ Sci & Technol China Hefei Natl Lab Hefei 230088 Peoples R China

ISBN: (纸本)9798350395099

As the leading candidate of quantum error correction codes, surface code suffers from significant overhead, such as execution time. Reducing the circuit's execution time not only enhances its execution efficiency but also improves fidelity. However, finding the shortest execution time is NP-hard. In this work, we study the surface code mapping and scheduling problem. To reduce the execution time of a quantum circuit, we first introduce two novel metrics: Circuit Parallelism Degree and Chip Communication Capacity to quantitatively characterize quantum circuits and chips. Then, we propose a resource-adaptive mapping and scheduling method, named Ecmas, with customized initialization of chip resources for each circuit. Ecmas can dramatically reduce the execution time in both double defect and lattice surgery models. Furthermore, we provide an additional version Ecmas-ReSu for sufficient qubits, which is performanceguaranteed and more efficient. Extensive numerical tests on practical datasets show that Ecmas outperforms the state-ofthe-art methods by reducing the execution time by 51.5% on average for double defect model. Ecmas can reach the optimal result in most benchmarks, reducing the execution time by up to 13.9% for lattice surgery model.

关键词： surface code Compilation Execution Time

来源：评论

学校读者我要写书评

暂无评论

Exploring surface code Decoding via Cryo-CMOS for Fault-Tolerant Quantum Computers 5

Exploring Surface Code Decoding via Cryo-CMOS for Fault-Tole...

引用

2024 International Conference on Quantum Computing and Engineering

作者： Wang, Ruotai Sato, Takashi Awano, Hiromitsu Kyoto Univ Grad Sch Informat Kyoto Japan

ISBN: (纸本)9798331541378

surface codes are crucial for fault-tolerant quantum computing (FTQC) and rely on syndrome analysis to identify quantum errors. Superconducting qubits are operating at extremely low temperatures, but the room-temperature syndrome analyzer limits scalability. This paper explores syndrome analysis at an intermediate temperature (around 4 K) and focuses on a hardware-friendly exhaustive search algorithm. Results show that using 4-bit weights enables error correction with a code distance of 5 and a physical error rate of 10(-4). The energy consumption per logical qubit per error correction is 1.13 x 10(-3) nJ, supporting up to 8.86 x 10(5) logical qubits in a cryogenic environment.

关键词： Quantum error correction Error decoding surface code Quantizing weights of matching graphs

来源：评论

学校读者我要写书评

暂无评论

Quantum Network Routing based on surface code Error Correction 44

Quantum Network Routing based on Surface Code Error Correcti...

引用

44th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Hu, Tianjie Wu, Jindi Li, Qun William & Mary Dept Comp Sci Williamsburg VA 23185 USA

ISBN: (纸本)9798350386066;9798350386059

Quantum networks encounter unavoidable channel noises and erasure errors, presenting a huge obstacle in designing protocols that attain both high reliability and efficiency. Typically, quantum networks fall into two categories: those utilize quantum entanglements for quantum teleportation, and those directly transfer the actual quantum messages. In this paper, we present SurfNet, a quantum network that inherits the main advantages from both categories. It employs surface codes as logical qubits for encoding messages, and utilizes two parallel communication channels to fault-tolerantly transfer each surface code in a modular manner. Our approach of using surface codes can timely correct both operational and photon loss errors within the network, and the integration of the two channels within the network can greatly improve network throughput. For the implementation of SurfNet, we propose a novel network architecture, designed to better integrate surface codes into quantum networks. We also propose a novel error correction decoder, designed to fully utilize the modular characteristic of surface codes within our network. Simulation results demonstrate that SurfNet with its decoder significantly enhances the communication fidelity within quantum networks.

关键词： Quantum Network Network Routing surface code Error Correction

来源：评论

学校读者我要写书评

暂无评论

WIT-Greedy: Hardware System Design ofWeighted ITerative Greedy Decoder for surface code 23

WIT-Greedy: Hardware System Design ofWeighted ITerative Gree...

引用

28th Asia and South Pacific Design Automation Conference (ASP-DAC)

作者： Liao, Wang Suzuki, Yasunari Tanimoto, Teruo Ueno, Yosuke Tokunaga, Yuuki Univ Tokyo Photon Sci Ctr Tokyo Japan NTT Comp & Data Sci Labs Atsugi Kanagawa Japan Kyushu Univ Fac Informat Sci & Elect Engn Fukuoka Japan Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan

ISBN: (纸本)9781450397834

Large error rates of quantum bits (qubits) are one of the main difficulties in the development of quantum computing. Performing quantum error correction (QEC) with surface codes is considered the most promising approach to reduce the error rates of qubits effectively. To perform error correction, we need an error-decoding unit, which estimates errors in the noisy physical qubits repetitively, to create a robust logical qubit. While complicated graph-matching problems must be solved within a strict time restriction for the error decoding, several hardware implementations that satisfy the restriction at a large code distance have been proposed. However, the existing decoder designs are still challenging in reducing the logical error rate. This is because they assume that the error rates of physical qubits are uniform while they have large variations in practice. According to our numerical simulation based on the quantum chip with the largest qubit number, neglecting the non-uniform error properties of a real quantum chip in the decoding process induces significant degradation of the logical error rate and spoils the benefit of QEC. To take the non-uniformity into account, decoders need to solve matching problems on a weighted graph, but they are difficult to solve using the existing designs without exceeding the time limit of decoding. Therefore, a decoder that can treat both the non-uniform physical error rates and the large surface code is strongly demanded. In this paper, we propose a hardware design of decoding units for the surface code that can treat the non-identical error properties with small latency at a large code distance. The key idea of our design is 1) constructing a look-up table for calculating the shortest paths between nodes in a weighted graph and 2) enabling parallel processing during decoding. The implementation results in field programmable gate array (FPGA) indicate that our design scales up to code distance 11 within a microsecond-level delay,

关键词： QEC surface code decoder non-identical weights FPGA

来源：评论

学校读者我要写书评

暂无评论

Magic state injection on the rotated surface code 22

Magic state injection on the rotated surface code

引用

19th ACM International Conference on Computing Frontiers (CF)

作者： Lao, Lingling Criger, Ben UCL London England Cambridge Quantum Cambridge England

ISBN: (纸本)9781450393386

Fault-tolerant quantum computing based on the surface code requires magic states to achieve universality. The initially prepared magic states have low fidelity and need to be purified by a costly procedure called magic state distillation. The high spatial-temporal cost for distillation can be reduced by improving the fidelity of initial magic states. Prior works have investigated state injection approaches on the regular surface code. In this work, we propose a magic state injection method for the rotated surface code that requires fewer physical qubits to encode one logical qubit. Analytical results show that our method could achieve lower logical error rates than the state-of-the-art approach for the regular surface code in [1]. When both the two-qubit gate and single-qubit operation error rates are.., the new method results in a logical error rate to 34p/15 compared to 46p/15 in [1]. This fidelity improvement and fewer qubit encoding requirement would help reduce the overhead of fault-tolerant quantum computation, which is crucial for practical implementation in the near term.

关键词： Quantum computing quantum error correction fault tolerance surface code magic state

来源：评论

学校读者我要写书评

暂无评论

Analysis of surface code under the restricted number of CNOT gates

Analysis of surface code under the restricted number of CNOT...

引用

IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS)

作者： Lee, Jonghyun Ha, Jinyoung Kang, Yujin Heo, Jun Korea Univ Sch Elect Engn Seoul South Korea

ISBN: (数字)9781665471213

ISBN: (纸本)9781665471213

To date, the surface code has become a promising candidate for quantum error correcting codes because of its high threshold, nearest gate operations and low weight stabilizers. Here, we assume that the number of CNOT gates is restricted because of the quantum crosstalk due to residual inter-qubit coupling or max channels per pulse gate. We thus calculated the effective physical error rate in this case and determine the surface code distance accordingly. The optimal code distance was obtained based on the logical error rate performance estimation of the surface code for some T-1 and T-2 time.

关键词： surface code CNOT restriction crosstalk

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：