Quantum Commuting Circuits and Complexity of Ising Partition Functions. - Keisuke Fujii 002; Tomoyuki Morimae (CoRR, 2013)

On the hardness of classically simulating the one clean qubit model. - Tomoyuki Morimae; Keisuke Fujii 002; Joseph F. Fitzsimons (CoRR, 2013)

Basics and applications of measurement-based quantum computing. - Tomoyuki Morimae (ISITA, 2014)

Impossibility of Classically Simulating One-Clean-Qubit Computation. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (CoRR, 2014)

Power of quantum computing with restricted postselections. - Tomoyuki Morimae; Harumichi Nishimura (CoRR, 2015)

Quantum proofs can be verified using only single qubit measurements. - Tomoyuki Morimae; Daniel Nagaj; Norbert Schuch (CoRR, 2015)

Ground state blind quantum computation on AKLT state. - Tomoyuki Morimae; Vedran Dunjko; Elham Kashefi (Quantum Inf. Comput., 2015)

Quantum Merlin-Arthur with Clifford Arthur. - Tomoyuki Morimae; Masahito Hayashi; Harumichi Nishimura; Keisuke Fujii 002 (Quantum Inf. Comput., 2015)

Space-Efficient Error Reduction for Unitary Quantum Computations. - Bill Fefferman; Hirotada Kobayashi; Cedric Yen-Yu Lin; Tomoyuki Morimae; Harumichi Nishimura (ICALP, 2016)

Power of Quantum Computation with Few Clean Qubits. - Keisuke Fujii 002; Hirotada Kobayashi; Tomoyuki Morimae; Harumichi Nishimura; Shuhei Tamate; Seiichiro Tani (ICALP, 2016)

Quantum Arthur-Merlin with single-qubit measurements. - Tomoyuki Morimae (CoRR, 2016)

Quantum state and circuit distinguishability with single-qubit measurements. - Tomoyuki Morimae (CoRR, 2016)

Finding resource states of measurement-based quantum computing is harder than quantum computing. - Tomoyuki Morimae (CoRR, 2016)

Quantum Merlin-Arthur with noisy channel. - Tomoyuki Morimae; Keisuke Fujii 002; Harumichi Nishimura (CoRR, 2016)

Power of one non-clean qubit. - Tomoyuki Morimae; Keisuke Fujii 002; Harumichi Nishimura (CoRR, 2016)

Modified group non-membership is in AWPP. - Tomoyuki Morimae; Harumichi Nishimura; Francois Le Gall (CoRR, 2016)

Quantum interpretations of AWPP and APP. - Tomoyuki Morimae; Harumichi Nishimura (Quantum Inf. Comput., 2016)

Hardness of classically sampling one clean qubit model with constant total variation distance error. - Tomoyuki Morimae (CoRR, 2017)

Merlinization of complexity classes above BQP. - Tomoyuki Morimae; Harumichi Nishimura (Quantum Inf. Comput., 2017)

Modified Group Non-Membership is in Promise-AWPP relative to group oracles. - Tomoyuki Morimae; Harumichi Nishimura; Francois Le Gall (Quantum Inf. Comput., 2017)

Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. - François Le Gall; Tomoyuki Morimae; Harumichi Nishimura; Yuki Takeuchi (MFCS, 2018)

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy. - Tomoyuki Morimae; Yuki Takeuchi; Harumichi Nishimura (Quantum, 2018)

Depth-scaling fine-grained quantum supremacy based on SETH and qubit-scaling fine-grained quantum supremacy based on Orthogonal Vectors and 3-SUM. - Tomoyuki Morimae; Suguru Tamaki (CoRR, 2019)

Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client. - Tomoyuki Morimae; Takeshi Koshiba (Quantum Inf. Comput., 2019)

Impossibility of blind quantum sampling for classical client. - Tomoyuki Morimae; Harumichi Nishimura; Yuki Takeuchi; Seiichiro Tani (Quantum Inf. Comput., 2019)

Fine-grained quantum computational supremacy. - Tomoyuki Morimae; Suguru Tamaki (Quantum Inf. Comput., 2019)

Arbitrable blind quantum computation. - Go Sato; Takeshi Koshiba; Tomoyuki Morimae (Quantum Inf. Process., 2019)

Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center. - Tomoyuki Morimae (CoRR, 2020)

Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing. - Tomoyuki Morimae (CoRR, 2020)

Rational proofs for quantum computing. - Tomoyuki Morimae; Harumichi Nishimura (Quantum Inf. Comput., 2020)

Additive-error fine-grained quantum supremacy. - Tomoyuki Morimae; Suguru Tamaki (Quantum, 2020)

Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing. - Tomoyuki Morimae; Takashi Yamakawa (CoRR, 2021)

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication. - Taiga Hiroka; Tomoyuki Morimae; Ryo Nishimaki; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2021)

Certified Everlasting Zero-Knowledge Proof for QMA. - Taiga Hiroka; Tomoyuki Morimae; Ryo Nishimaki; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2021)

Quantum commitments and signatures without one-way functions. - Tomoyuki Morimae; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2021)

computing. - Tomoyuki Morimae (Quantum Inf. Comput., 2021)

Improved Hardness Results for the Guided Local Hamiltonian Problem. - Sevag Gharibian; Ryu Hayakawa; François Le Gall; Tomoyuki Morimae (CoRR, 2022)

From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. - Minki Hhan; Tomoyuki Morimae; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2022)

Certified Everlasting Functional Encryption. - Taiga Hiroka; Tomoyuki Morimae; Ryo Nishimaki; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2022)

Proofs of Quantumness from Trapdoor Permutations. - Tomoyuki Morimae; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2022)

Classically Verifiable NIZK for QMA with Preprocessing. - Tomoyuki Morimae; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2022)

One-Wayness in Quantum Cryptography. - Tomoyuki Morimae; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2022)

Divide-and-conquer verification method for noisy intermediate-scale quantum computation. - Yuki Takeuchi; Yasuhiro Takahashi; Tomoyuki Morimae; Seiichiro Tani (Quantum, 2022)

Sumcheck-based delegation of quantum computing to rational server. - Yuki Takeuchi; Tomoyuki Morimae; Seiichiro Tani (Theor. Comput. Sci., 2022)

Improved Hardness Results for the Guided Local Hamiltonian Problem. - Chris Cade; Marten Folkertsma; Sevag Gharibian; Ryu Hayakawa; François Le Gall; Tomoyuki Morimae; Jordi Weggemans (ICALP, 2023)

A Note on Output Length of One-Way State Generators. - Minki Hhan; Tomoyuki Morimae; Takashi Yamakawa (CoRR, 2023)

Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More. - Taiga Hiroka; Fuyuki Kitagawa; Tomoyuki Morimae; Ryo Nishimaki; Tapas Pal; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2023)

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions. - Fuyuki Kitagawa; Tomoyuki Morimae; Ryo Nishimaki; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2023)

Unconditionally Secure Commitments with Quantum Auxiliary Inputs. - Tomoyuki Morimae; Barak Nehoran; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2023)

Revocable Quantum Digital Signatures. - Tomoyuki Morimae; Alexander Poremba; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2023)

Quantum Advantage from One-Way Functions. - Tomoyuki Morimae; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2023)

Exponential Quantum One-Wayness and EFI Pairs. - Giulio Malavolta; Tomoyuki Morimae; Michael Walter 005; Takashi Yamakawa (SCN (1), 2024)

A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID. - Amit Behera; Giulio Malavolta; Tomoyuki Morimae; Tamer Mour; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2024)

CountCrypt: Quantum Cryptography between QCMA and PP. - Eli Goldin; Tomoyuki Morimae; Saachi Mutreja; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2024)

Quantum Cryptography from Meta-Complexity. - Taiga Hiroka; Tomoyuki Morimae (IACR Cryptol. ePrint Arch., 2024)

A Simple Framework for Secure Key Leasing. - Fuyuki Kitagawa; Tomoyuki Morimae; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2024)

Cryptographic Characterization of Quantum Advantage. - Tomoyuki Morimae; Yuki Shirakawa; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2024)

Quantum Group Actions. - Tomoyuki Morimae; Keita Xagawa (IACR Cryptol. ePrint Arch., 2024)

Quantum Unpredictability. - Tomoyuki Morimae; Shogo Yamada; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2024)

Quantum Cryptography and Meta-Complexity. - Taiga Hiroka; Tomoyuki Morimae (CRYPTO (2), 2025)

From Worst-Case Hardness of NP to Quantum Cryptography via Quantum Indistinguishability Obfuscation. - Tomoyuki Morimae; Yuki Shirakawa; Takashi Yamakawa (IACR Cryptol. ePrint Arch., 2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography. - Taiga Hiroka; Min-Hsiu Hsieh; Tomoyuki Morimae (CoRR, 2025)