アヤマリタイセイリョウシケイサンノジツゲンニムケタコウリツテキナマホウジョウタイノセイセイトショウヒ
裕 平野, Yutaka Hirano
Abstract
Quantum computation promises exponential or polynomial speedups over classical computation for a wide range of problems, including integer factoring, quantum chemistry, and linear-system solving.However, current quantum devices remain too noisy to execute complex algorithms reliably.Overcoming this noise and achieving quantum advantage require a fault-tolerant quantum computer (FTQC).The resource overhead associated with fault-tolerant operation is substantial, and reducing this overhead remains one of the central challenges.A major source of this overhead arises from the implementation of non-Clifford gates, which are essential for universal quantum computation.A non-Clifford gate such as the T gate is implemented using a special quantum state known as a magic state, which is prepared via a process called magic state distillation.Magic state distillation is resource-intensive and remains a major bottleneck in FTQC.Hence, reducing the distillation overhead is necessary to lower the overall FTQC overhead.The large overhead of magic state distillation has significantly influenced FTQC architectures.In particular, it has motivated compilation schemes optimized under the constraint of expensive magic state distillation.While reducing the distillation overhead is crucial, it is not sufficient; lowering the overall FTQC overhead also requires revisiting design choices guided by this constraint.Therefore, efficient methods are required not only for preparing magic states but also for consuming them.In this thesis, we reduce the overhead of fault-tolerant quantum computation by focusing on the preparation and consumption of magic states.In contrast to traditional logical-level distillation, physical-level distillation allows direct implementation with physical gates and has the potential to drastically reduce the distillation overhead.However, existing physical-level distillation protocols, such as zero-level distillation, cannot directly yield high-fidelity magic states.We propose two magic state distillation protocols that use physical-level distillation techniques to efficiently prepare high-fidelity magic states.The first protocol is a two-level distillation protocol using physical-level distillation as the first-level stage.The second protocol utilizes lattice surgery to reduce the spacetime overhead of a physical-level distillation protocol.The former targets a high-fidelity regime, whereas the latter targets an intermediate-fidelity regime-lower than the former, but higher than zero-level distillation.Next, we investigate FTQC architectures that can efficiently consume the magic states prepared by these protocols.Because magic state distillation is probabilistic, occasional failures can delay computation.Moreover, physical-level distillation protocols generally exhibit higher failure probabilities than logical-level ones.This delay is amplified by parallel execution, making it an i ii important consideration for FTQC using physical-level distillation protocols.We therefore propose a scheme to mitigate the negative performance impact caused by magic state distillation failures by introducing a pool of magic states for each distillation factory.The proposed distillation protocols allow the simultaneous preparation of many magic states.Leveraging this capability, we propose an FTQC compilation scheme optimized for highly parallel quantum algorithms.By performing magic state distillation locally and consuming magic states in parallel, the scheme enables highly parallel execution and consequently reduces the computational time overhead.Overall, this thesis presents a unified approach to reducing the overhead of fault-tolerant quantum computation.By improving both the preparation and consumption of magic states, it advances the design of resource-efficient FTQC architectures.These results demonstrate that efficient magic state preparation motivates efficient magic state consumption, and vice versa.Together, they bring us closer to the practical realization of fault-tolerant quantum computers.