activity
20072026
most citedClaw Finding Algorithms Using Quantum Walk

69 citations · 261 across the 33 of their papers we have counts for

collaborators

36 papers

quant-ph2026

Anonymous quantum sensing robust against state preparation errors

Hiroto Kasai, Seiichiro Tani, Yasuhiro Tokura +1

Networked quantum sensors have several applications such as the mapping of magnetic fields. When the magnetic fields are biomagnetic ones, i.e., they contain some private informati…

quant-ph2024★ 1 cited

Quantum algorithm for unstructured search of ranked targets

Kota Tani, Shunji Tsuchiya, Seiichiro Tani +1

Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cry…

quant-ph2024

Approximate Degrees of Multisymmetric Properties with Application to Quantum Claw Detection

Seiichiro Tani

The claw problem is central in the fields of theoretical computer science as well as cryptography. The optimal quantum query complexity of the problem is known to be $Ω\left(\sqrt{…

quant-ph2024

On the hardness of conversion from entangled proof into separable one

Seiseki Akibue, Go Kato, Seiichiro Tani

A quantum channel whose image approximates the set of separable states is called a disentangler, which plays a prominent role in the investigation of variants of the computational…

quant-ph2023★ 6 cited

Probabilistic state synthesis based on optimal convex approximation

Seiseki Akibue, Go Kato, Seiichiro Tani

When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed a…

quant-ph2023★ 4 cited

Probabilistic unitary synthesis with optimal accuracy

Seiseki Akibue, Go Kato, Seiichiro Tani

The purpose of unitary synthesis is to find a gate sequence that optimally approximates a target unitary transformation. A new synthesis approach, called probabilistic synthesis, h…