Tomoyuki Morimae

IACR Cryptol. ePrint Arch., 2023

Revocable Quantum Digital Signatures.

[BibT_eX]

[DOI]

Alexander Poremba

IACR Cryptol. ePrint Arch., 2023

Unconditionally Secure Commitments with Quantum Auxiliary Inputs.

[BibT_eX]

[DOI]

Barak Nehoran

IACR Cryptol. ePrint Arch., 2023

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Certified Everlasting Secure Collusion-Resistant Functional Encryption, and More.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

A Note on Output Length of One-Way State Generators.

[BibT_eX]

[DOI]

Minki Hhan

CoRR, 2023

Improved Hardness Results for the Guided Local Hamiltonian Problem.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Sumcheck-based delegation of quantum computing to rational server.

[BibT_eX]

[DOI]

Yuki Takeuchi

Seiichiro Tani

Theor. Comput. Sci., 2022

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

[BibT_eX]

[DOI]

Quantum, 2022

One-Wayness in Quantum Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Classically Verifiable NIZK for QMA with Preprocessing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Proofs of Quantumness from Trapdoor Permutations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Certified Everlasting Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments.

[BibT_eX]

[DOI]

Minki Hhan

IACR Cryptol. ePrint Arch., 2022

Improved Hardness Results for the Guided Local Hamiltonian Problem.

[BibT_eX]

[DOI]

CoRR, 2022

2021

computing.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2021

Quantum commitments and signatures without one-way functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Certified Everlasting Zero-Knowledge Proof for QMA.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2020

Additive-error fine-grained quantum supremacy.

[BibT_eX]

[DOI]

Suguru Tamaki

Quantum, 2020

Rational proofs for quantum computing.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2019

Arbitrable blind quantum computation.

[BibT_eX]

[DOI]

Go Sato

Takeshi Koshiba

Quantum Inf. Process., 2019

Fine-grained quantum computational supremacy.

[BibT_eX]

[DOI]

Suguru Tamaki

Quantum Inf. Comput., 2019

Impossibility of blind quantum sampling for classical client.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2019

Impossibility Of Perfectly-Secure Ono-Round Delegated Quantum Computing for classical client.

[BibT_eX]

[DOI]

Takeshi Koshiba

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.

[BibT_eX]

[DOI]

Suguru Tamaki

CoRR, 2019

2018

Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Francois Le Gall

Quantum Inf. Comput., 2017

Merlinization of complexity classes above BQP.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2017

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

[BibT_eX]

[DOI]

Yuki Takeuchi

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

2016

Quantum interpretations of AWPP and APP.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2016

Modified group non-membership is in AWPP.

[BibT_eX]

[DOI]

Francois Le Gall

CoRR, 2016

Power of one non-clean qubit.

[BibT_eX]

[DOI]

CoRR, 2016

Quantum Merlin-Arthur with noisy channel.

[BibT_eX]

[DOI]

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Quantum state and circuit distinguishability with single-qubit measurements.

[BibT_eX]

[DOI]

CoRR, 2016

Quantum Arthur-Merlin with single-qubit measurements.

[BibT_eX]

[DOI]

CoRR, 2016

Power of Quantum Computation with Few Clean Qubits.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Space-Efficient Error Reduction for Unitary Quantum Computations.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Quantum Merlin-Arthur with Clifford Arthur.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2015

Ground state blind quantum computation on AKLT state.

[BibT_eX]

[DOI]

Vedran Dunjko

Elham Kashefi

Quantum Inf. Comput., 2015

Quantum proofs can be verified using only single qubit measurements.

[BibT_eX]

[DOI]

Daniel Nagaj

Norbert Schuch

CoRR, 2015

Power of quantum computing with restricted postselections.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Impossibility of Classically Simulating One-Clean-Qubit Computation.

[BibT_eX]

[DOI]

CoRR, 2014

Basics and applications of measurement-based quantum computing.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013

On the hardness of classically simulating the one clean qubit model.

[BibT_eX]

[DOI]

Joseph F. Fitzsimons

CoRR, 2013

Quantum Commuting Circuits and Complexity of Ising Partition Functions.

[BibT_eX]

[DOI]