Tomoyuki Morimae

According to our database1, Tomoyuki Morimae authored at least 41 papers between 2013 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Sumcheck-based delegation of quantum computing to rational server.
Theor. Comput. Sci., 2022

Divide-and-conquer verification method for noisy intermediate-scale quantum computation.
Quantum, 2022

Proofs of Quantumness from Trapdoor Permutations.
CoRR, 2022

Certified Everlasting Functional Encryption.
CoRR, 2022

Improved Hardness Results for the Guided Local Hamiltonian Problem.
CoRR, 2022

2021
computing.
Quantum Inf. Comput., 2021

Quantum commitments and signatures without one-way functions.
IACR Cryptol. ePrint Arch., 2021

Certified Everlasting Zero-Knowledge Proof for QMA.
IACR Cryptol. ePrint Arch., 2021

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication.
IACR Cryptol. ePrint Arch., 2021

Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing.
CoRR, 2021

2020
Additive-error fine-grained quantum supremacy.
Quantum, 2020

Rational proofs for quantum computing.
Quantum Inf. Comput., 2020

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

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

2019
Arbitrable blind quantum computation.
Quantum Inf. Process., 2019

Fine-grained quantum computational supremacy.
Quantum Inf. Comput., 2019

Impossibility of blind quantum sampling for classical client.
Quantum Inf. Comput., 2019

Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client.
Quantum Inf. Comput., 2019

Depth-scaling fine-grained quantum supremacy based on SETH and qubit-scaling fine-grained quantum supremacy based on Orthogonal Vectors and 3-SUM.
CoRR, 2019

2018
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Modified Group Non-Membership is in Promise-AWPP relative to group oracles.
Quantum Inf. Comput., 2017

Merlinization of complexity classes above BQP.
Quantum Inf. Comput., 2017

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy.
CoRR, 2017

Hardness of classically sampling one clean qubit model with constant total variation distance error.
CoRR, 2017

2016
Quantum interpretations of AWPP and APP.
Quantum Inf. Comput., 2016

Modified group non-membership is in AWPP.
CoRR, 2016

Power of one non-clean qubit.
CoRR, 2016

Quantum Merlin-Arthur with noisy channel.
CoRR, 2016

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

Quantum state and circuit distinguishability with single-qubit measurements.
CoRR, 2016

Quantum Arthur-Merlin with single-qubit measurements.
CoRR, 2016

Power of Quantum Computation with Few Clean Qubits.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Space-Efficient Error Reduction for Unitary Quantum Computations.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Quantum Merlin-Arthur with Clifford Arthur.
Quantum Inf. Comput., 2015

Ground state blind quantum computation on AKLT state.
Quantum Inf. Comput., 2015

Quantum proofs can be verified using only single qubit measurements.
CoRR, 2015

Power of quantum computing with restricted postselections.
CoRR, 2015

2014
Impossibility of Classically Simulating One-Clean-Qubit Computation.
CoRR, 2014

Basics and applications of measurement-based quantum computing.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
On the hardness of classically simulating the one clean qubit model.
CoRR, 2013

Quantum Commuting Circuits and Complexity of Ising Partition Functions.
CoRR, 2013


  Loading...