59 citations · 576 across the 44 of their papers we have counts for
45 papers · 1 filter
Thermodynamic Proof of Quantumness without Structure
Florian Meier, Hayata Yamasaki
Demonstrating that a machine performs genuinely quantum operations is a central challenge in quantum information processing. Existing proofs of quantumness typically rely on comput…
Quantum Information Decoupling Beyond Finite Dimensions
Hayata Yamasaki
Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formul…
Lean-Quantum: Toward AI-Assisted Formalization of Quantum Information
Kazumi Kasaura, Kei Tsukamoto, Kento Mori +6
Quantum information theory is built on entropic quantities; among them, the sandwiched Rényi relative entropy is a fundamental divergence with various applications, and its data pr…
Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes
Kento Tsubouchi, Hayata Yamasaki, Shiro Tamiya
Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation due to their potential for low-overhead protocols. A common a…
Generalized Quantum Stein's Lemma for Classical-Quantum Dynamical Resources
Masahito Hayashi, Hayata Yamasaki
Channel conversion constitutes a pivotal paradigm in information theory and its applications to quantum physics, providing a unified problem setting that encompasses celebrated res…
Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder
Yugo Takada, Hayata Yamasaki
Reducing space and time overheads of fault-tolerant quantum computation (FTQC) has been receiving increasing attention as it is crucial for the development of quantum computers and…
Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes
Shiro Tamiya, Masato Koashi, Hayata Yamasaki
A major challenge in fault-tolerant quantum computation (FTQC) is to reduce both space overhead -- the large number of physical qubits per logical qubit -- and time overhead -- the…
Generalized Quantum Stein's Lemma and Second Law of Quantum Resource Theories
Masahito Hayashi, Hayata Yamasaki
The second law of thermodynamics is the cornerstone of physics, characterizing the convertibility between thermodynamic states through a single function, entropy. Given the univers…
Improved bounds on quantum uncommon information
Yonghae Lee, Joonwoo Bae, Hayata Yamasaki +1
In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed…
Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computer
Shinichi Sunami, Shiro Tamiya, Ryotaro Inoue +2
Neutral atoms are among the leading platforms toward realizing fault-tolerant quantum computation (FTQC). However, scaling up a single neutral-atom device beyond atoms…
Quantum State Preparation via Free Binary Decision Diagram
Yu Tanaka, Hayata Yamasaki, Mio Murao
Quantum state preparation (QSP) is a fundamental task in quantum computation to prepare a quantum state for a given classical description of the quantum state. The classical descri…
Classical simulation and quantum resource theory of non-Gaussian optics
Oliver Hahn, Ryuji Takagi, Giulia Ferrini +1
We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing th…
Generalized Quantum Stein's Lemma: Redeeming Second Law of Resource Theories
Hayata Yamasaki, Kohdai Kuroiwa
[Note: After the first version of this manuscript was uploaded, the authors of [Berta, Brandão, Gour, Lami, Plenio, Regula, and Tomamichel, Quantum 7, 1103 (2023)] pointed out an i…
Concatenate codes, save qubits
Satoshi Yoshida, Shiro Tamiya, Hayata Yamasaki
The essential requirement for fault-tolerant quantum computation (FTQC) is the total protocol design to achieve a fair balance of all the critical factors relevant to its practical…
Entanglement cost for infinite-dimensional physical systems
Hayata Yamasaki, Kohdai Kuroiwa, Patrick Hayden +1
We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state with finite quantum entropy on at least one…
Advantage of Quantum Machine Learning from General Computational Advantages
Hayata Yamasaki, Natsuto Isogai, Mio Murao
An overarching milestone of quantum machine learning (QML) is to demonstrate the advantage of QML over all possible classical learning methods in accelerating a common type of lear…
Robustness- and weight-based resource measures without convexity restriction: Multicopy witness and operational advantage in static and dynamical quantum resource theories
Kohdai Kuroiwa, Ryuji Takagi, Gerardo Adesso +1
Quantum resource theories (QRTs) provide a unified framework to analyze quantum properties as resources for achieving advantages in quantum information processing. The generalized…
Every quantum helps: Operational advantage of quantum resources beyond convexity
Kohdai Kuroiwa, Ryuji Takagi, Gerardo Adesso +1
Identifying what quantum-mechanical properties are useful to untap a superior performance in quantum technologies is a pivotal question. Quantum resource theories provide a unified…
Efficient decoding of stabilizer code by single-qubit local operations and classical communication
Koki Shiraishi, Hayata Yamasaki, Mio Murao
We construct a protocol for extracting distributed one-qubit quantum information encoded in a stabilizer code of multiple qubits, only by single-qubit local operations and classica…
Energy-Consumption Advantage of Quantum Computation
Florian Meier, Hayata Yamasaki
Energy consumption in solving computational problems has been gaining growing attention as one of the key performance measures for computers. Quantum computation is known to offer…
Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation
Hayata Yamasaki, Sathyawageeswar Subramanian, Satoshi Hayakawa +1
A significant challenge in the field of quantum machine learning (QML) is to establish applications of quantum computation to accelerate common tasks in machine learning such as th…
Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
Andrew S. Darmawan, Yoshifumi Nakata, Shiro Tamiya +1
Recent work [M. J. Gullans et al., Physical Review X, 11(3):031066 (2021)] has shown that quantum error correcting codes defined by random Clifford encoding circuits can achieve a…
Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
Hayata Yamasaki, Masato Koashi
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation dema…
Entanglement detection with imprecise measurements
Simon Morelli, Hayata Yamasaki, Marcus Huber +1
We investigate entanglement detection when the local measurements only nearly correspond to those intended. This corresponds to a scenario in which measurement devices are not perf…