Seiichiro Tani

From MaRDI portal
(Redirected from Person:347107)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
Theoretical Computer Science
2025-05-04Paper
Rewindable quantum computation and its equivalence to cloning and adaptive postselection
Theory of Computing Systems
2025-02-28Paper
Rewindable quantum computation and its equivalence to cloning and adaptive postselection2024-11-20Paper
Space-bounded unitary quantum computation with postselection2024-08-06Paper
Output-size sensitiveness of OBDD construction through maximal independent set problem
Lecture Notes in Computer Science
2023-12-12Paper
Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
(available as arXiv preprint)
2023-11-02Paper
Computing the Tutte polynomial of a graph of moderate size2023-03-21Paper
Probabilistic unitary synthesis with optimal accuracy2023-01-16Paper
Sumcheck-based delegation of quantum computing to rational server
Lecture Notes in Computer Science
2022-12-22Paper
scientific article; zbMATH DE number 7559454 (Why is no real title available?)2022-07-18Paper
Sumcheck-based delegation of quantum computing to rational server
Theoretical Computer Science
2022-06-13Paper
Quadratic improvement on accuracy of approximating pure quantum states and unitary gates by probabilistic implementation2021-11-10Paper
Classically simulating quantum circuits with local depolarizing noise
Theoretical Computer Science
2021-11-01Paper
Power of uninitialized qubits in shallow quantum circuits
Theoretical Computer Science
2021-01-25Paper
Quantum algorithm for the multicollision problem
Theoretical Computer Science
2020-10-12Paper
scientific article; zbMATH DE number 7228448 (Why is no real title available?)
(available as arXiv preprint)
2020-08-05Paper
Improved quantum multicollision-finding algorithm
(available as arXiv preprint)
2020-02-25Paper
Power of quantum computation with few clean qubits
(available as arXiv preprint)
2017-12-19Paper
Quantum query complexity of almost all functions with fixed on-set size
Computational Complexity
2016-11-30Paper
Collapse of the hierarchy of constant-depth exact quantum circuits
Computational Complexity
2016-11-30Paper
Quantum algorithms for finding constant-sized sub-hypergraphs
Theoretical Computer Science
2015-12-11Paper
Commuting quantum circuits with few outputs are unlikely to be classically simulatable
Lecture Notes in Computer Science
2015-10-29Paper
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory
2015-09-24Paper
Simpler exact leader election via quantum reduction
Chicago Journal of Theoretical Computer Science
2015-02-09Paper
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
Lecture Notes in Computer Science
2014-09-26Paper
The one-way communication complexity of subgroup membership
Chicago Journal of Theoretical Computer Science
2014-05-06Paper
Reconstructing strings from substrings with quantum queries
Algorithm Theory – SWAT 2012
2012-08-14Paper
The quantum query complexity of certification2011-10-05Paper
Quantum addition circuits and unbounded fan-out
(available as arXiv preprint)
2011-10-05Paper
Claw finding algorithms using quantum walk
Theoretical Computer Science
2009-11-06Paper
Quantum Query Complexity of Boolean Functions with Small On-Sets
Algorithms and Computation
2009-01-29Paper
An Improved Claw Finding Algorithm Using Quantum Walk
Mathematical Foundations of Computer Science 2007
2008-09-17Paper
Multi-party Quantum Communication Complexity with Routed Messages
Lecture Notes in Computer Science
2008-07-10Paper
STACS 2005
Lecture Notes in Computer Science
2005-12-02Paper
scientific article; zbMATH DE number 2043943 (Why is no real title available?)2004-02-17Paper
scientific article; zbMATH DE number 1555978 (Why is no real title available?)2001-01-24Paper
scientific article; zbMATH DE number 1354131 (Why is no real title available?)1999-10-31Paper
Probabilistic state synthesis based on optimal convex approximation
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Seiichiro Tani