Seiichiro Tani

CoRR, 2024

2023

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection.

[BibT_eX]

[DOI]

Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

2022

Sumcheck-based delegation of quantum computing to rational server.

[BibT_eX]

[DOI]

Yuki Takeuchi

Tomoyuki Morimae

Theor. Comput. Sci., 2022

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

[BibT_eX]

[DOI]

Quantum, 2022

Space-Bounded Unitary Quantum Computation with Postselection.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Classically simulating quantum circuits with local depolarizing noise.

[BibT_eX]

[DOI]

Yuki Takeuchi

Theor. Comput. Sci., 2021

Power of uninitialized qubits in shallow quantum circuits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Computational self-testing for entangled magic states.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2020

Quantum algorithm for the multicollision problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Efficiently generating ground states is hard for postselected quantum computation.

[BibT_eX]

[DOI]

Yuki Takeuchi

CoRR, 2020

Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Impossibility of blind quantum sampling for classical client.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2019

2018

Improved Quantum Multicollision-Finding Algorithm.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

2017

A fast exact quantum algorithm for solitude verification.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2017

2016

Quantum algorithms for finding constant-sized sub-hypergraphs.

[BibT_eX]

[DOI]

François Le Gall

Harumichi Nishimura

Theor. Comput. Sci., 2016

Commuting quantum circuits with few outputs are unlikely to be classically simulatable.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2016

Shallow Quantum Circuits with Uninitialized Ancillary Qubits.

[BibT_eX]

[DOI]

CoRR, 2016

Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits.

[BibT_eX]

[DOI]

Comput. Complex., 2016

Quantum Query Complexity of Almost All Functions with Fixed On-set Size.

[BibT_eX]

[DOI]

Comput. Complex., 2016

Power of Quantum Computation with Few Clean Qubits.

[BibT_eX]

[DOI]

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

2014

Impossibility of Classically Simulating One-Clean-Qubit Computation.

[BibT_eX]

[DOI]

CoRR, 2014

Simpler Exact Leader Election via Quantum Reduction.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2014

2013

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs.

[BibT_eX]

[DOI]

François Le Gall

Harumichi Nishimura

CoRR, 2013

2012

Compression of View on Anonymous Networks - Folded View -.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2012

Exact Quantum Algorithms for the Leader Election Problem.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2012

Reconstructing Strings from Substrings with Quantum Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011

Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions

[BibT_eX]

[DOI]

CoRR, 2011

The One-Way Communication Complexity of Subgroup Membership.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2011

2010

Quantum addition circuits and unbounded fan-out.

[BibT_eX]

[DOI]

Noboru Kunihiro

Quantum Inf. Comput., 2010

The quantum query complexity of certification.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2010

Computing on Anonymous Quantum Network

[BibT_eX]

[DOI]

CoRR, 2010

2009

Claw finding algorithms using quantum walk.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Multi-Party Quantum Communication Complexity with Routed Messages.

[BibT_eX]

[DOI]

Masaki Nakanishi

Shigeru Yamashita

IEICE Trans. Inf. Syst., 2009

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size

[BibT_eX]

[DOI]

CoRR, 2009

The One-Way Communication Complexity of Group Membership

[BibT_eX]

[DOI]

CoRR, 2009

Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Quantum Query Complexity of Boolean Functions with Small On-Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

An Improved Claw Finding Algorithm Using Quantum Walk.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2005

Design and Implementation of Advanced Multicast Router Based on Cluster Computing.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Parallel and Distributed Systems, 2005

2001

Adaptive Stream Multicast Based on IP Unicast and Dynamic Commercial Attachment Mechanism: An Active Network Implementation.

[BibT_eX]

[DOI]

Toshiaki Miyazaki

Noriyuki Takahashi

Proceedings of the Active Networks, IFIP-TC6 Third International Working Conference, 2001

2000

Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer.

[BibT_eX]

[DOI]

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999

Efficient Path Selection for Delay Testing Based on Path Clustering.

[BibT_eX]

[DOI]

J. Electron. Test., 1999

Virtual BUS: A Simple Implementation of an Effortless Networking System Based on PVM.

[BibT_eX]

[DOI]

Shinya Ishihara

Atsushi Takahara

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1999

Virtual BUS: An Easy-to-Use Environment for Distributed Resources.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 26th Conference on Local Computer Networks, 1999

1998

Efficient Path Selection for Delay Testing Based on Partial Path Evaluation.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE VLSI Test Symposium (VTS '98), 28 April, 1998

1995

Computing the Tutte Polynomial of a Graph of Moderate Size.

[BibT_eX]

[DOI]

Kyoko Sekine

Hiroshi Imai

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem.

[BibT_eX]

[DOI]

Kazuyoshi Hayase

Kunihiko Sadakane

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs.

[BibT_eX]

[DOI]

Hiroshi Imai

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams.

[BibT_eX]

[DOI]