collaborators

12 papers

quant-ph2026

Optimizing Entanglement Manipulation via Algebraic-Geometric Decompositions and Semidefinite Programming Hierarchies

Seiseki Akibue, Jisho Miyazaki, Hiroyuki Osaka

In the study of distributed quantum information processing, it is a fundamental problem to optimize local operations in the implementation of non-local quantum operations assisted…

quant-ph2026

Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality

Seiseki Akibue, Rudy Raymond, Suguru Tamaki +1

Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the s…

quant-ph2026

Localization of joint quantum measurements on by entangled resources with Schmidt number at most

Seiseki Akibue, Jisho Miyazaki

Localizable measurements are joint quantum measurements that can be implemented using only non-adaptive local operations and shared entanglement. We provide a protocol-independent…

quant-ph2026

Circuit Optimization for Universality Transformation

Yasuaki Nakayama, Yuki Takeuchi, Seiseki Akibue

It is known that a computationally universal gate set can be transformed to a strictly universal one using one maximally imaginary state an…

quant-ph2026

Multi-qubit controlled gate with optimal T-count

Soichiro Yamazaki, Seiseki Akibue

Controlled gates are key components in various quantum algorithms. Improving on the prior work of Gosset et al., we show that, for an allowed error , $3\log_2(1/\varep…

quant-ph2026

Uniqueness of imaginarity-assisted transformation from computationally universal to strictly universal quantum computation

Yasuaki Nakayama, Yuki Takeuchi, Seiseki Akibue

The computational universality with an elementary gate set can be transformed to the strict universality by using a maximally imaginary state and some non-…