3.3k citations
- NTT Basic Research LaboratoriesJP437 papers
- The University of TokyoJP123 papers
- Japan Science and Technology AgencyJP95 papers
- National Institute of InformaticsJP60 papers
- The University of OsakaJP52 papers
- Tokyo Institute of TechnologyJP47 papers
- Kyoto UniversityJP39 papers
- Waseda UniversityJP28 papers
- Delft University of TechnologyNL25 papers
- Nagoya UniversityJP25 papers
- Stanford UniversityUS24 papers
- Tohoku UniversityJP24 papers
14 papers · 2 filters
Q3DE: A fault-tolerant quantum computer architecture for multi-bit burst errors by cosmic rays
Yasunari Suzuki, Takanori Sugiyama, Tomochika Arai +3
Demonstrating small error rates by integrating quantum error correction (QEC) into an architecture of quantum computing is the next milestone towards scalable fault-tolerant quantu…
LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
Takumi Kobori, Yasunari Suzuki, Yosuke Ueno +3
Current fault-tolerant quantum computer (FTQC) architectures utilize several encoding techniques to enable reliable logical operations with restricted qubit connectivity. However,…
All-optical measurement-device-free feedforward enabling ultra-fast quantum information processing
Taichi Yamashima, Takahiro Kashiwazaki, Takumi Suzuki +8
Optical circuit systems, unlike other systems, have the potential to perform quantum information processing (QIP) at higher clock rate than conventional processing. The approach ut…
Cryptographic Characterization of Quantum Advantage
Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa
Quantum computational advantage refers to an existence of computational tasks that are easy for quantum computing but hard for classical one. Unconditionally showing quantum advant…
On Computational Complexity of Unitary and State Design Properties
Yoshifumi Nakata, Yuki Takeuchi, Martin Kliesch +1
We investigate unitary and state -designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximat…
Type-Based Verification of Connectivity Constraints in Lattice Surgery
Ryo Wakizaka, Yasunari Suzuki, Atsushi Igarashi
Fault-tolerant quantum computation using lattice surgery can be abstracted as operations on graphs, wherein each logical qubit corresponds to a vertex of the graph, and multi-qubit…