4 citations · 5 across the 9 of their papers we have counts for
11 papers
Hyperbolic color codes with constant rate and polynomial distance
Shun Hasegawa, Hayata Yamasaki
Recent advances in quantum hardware relax the strict geometric-locality constraints traditionally imposed on quantum error-correcting codes, motivating interest in high-rate quantu…
Sparse-Blossom Decoding in Time
Ryo Mikami, Hayata Yamasaki
Matching-based decoding is widely used in quantum error correction, and accelerating it is key to enabling fast and scalable fault-tolerant quantum computation. Minimum-weight perf…
A Quantum-Inspired Dequantization Method for Diagonally Weighted Matrix Functions: Application to Learning with Optimized Random Features
Natsuto Isogai, Mio Murao, Hayata Yamasaki
Quantum-inspired classical algorithms have dequantized several quantum machine learning routines by replacing quantum linear-algebra subroutines with classical counterparts. Howeve…
Generalized quantum Stein's lemma for mixed sources
Haruka Kanazawa, Hayata Yamasaki
The generalized quantum Stein's lemma characterizes the optimal asymptotic exponent of the type-II error in quantum hypothesis testing for an independent and identically distribute…
Winning Lottery Tickets in Neural Networks via a Quantum-Inspired Classical Algorithm
Natsuto Isogai, Hayata Yamasaki, Sho Sonoda +1
Quantum machine learning (QML) aims to accelerate machine learning tasks by exploiting quantum computation. Previous work studied a QML algorithm for selecting sparse subnetworks f…
Overflow-Safe Polylog-Time Parallel Minimum-Weight Perfect Matching Decoder: Toward Experimental Demonstration
Ryo Mikami, Hayata Yamasaki
Fault-tolerant quantum computation (FTQC) requires fast and accurate decoding of quantum errors, which is often formulated as a minimum-weight perfect matching (MWPM) problem. A de…
Constant-space-overhead fault-tolerant quantum input/output and communication
Paula Belzig, Hayata Yamasaki
Fault-tolerant capacities quantify the ability of a quantum channel to reliably transmit information when every component of the encoding and decoding procedure is noisy. Earlier w…
Proof of a finite threshold for the union-find decoder
Satoshi Yoshida, Ethan Lake, Hayata Yamasaki
Fast decoders that achieve strong error suppression are essential for fault-tolerant quantum computation (FTQC) from both practical and theoretical perspectives. The union-find (UF…
Characterizing Space-Constrained Implementability of Quantum Instruments via Signaling Conditions
Kosuke Matsui, Jun-Yi Wu, Hayata Yamasaki +2
Scaling up the number of qubits available on quantum processors remains technically demanding even in the long term; it is therefore crucial to clarify the number of qubits require…
Continuous-Variable Fault-Tolerant Quantum Computation under General Noise
Takaya Matsuura, Nicolas C. Menicucci, Hayata Yamasaki
The quantum error-correcting code in the continuous-variable (CV) system attracts much attention due to its flexibility and high resistance against specific noise. However, the the…
Constant-Overhead Magic State Distillation
Adam Wills, Min-Hsiu Hsieh, Hayata Yamasaki
Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states req…