activity
20142026
most citedNetwork coding for distributed quantum computation over cluster and butterfly networks

20 citations · 78 across the 24 of their papers we have counts for

collaborators

24 papers

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

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 and…

quant-ph2026

Multi-qubit controlled gate synthesis without T-count overhead in the small-error limit

Soichiro Yamazaki, Seiseki Akibue, Kaoru Sano

We study the Clifford+T synthesis of quantum multiplexers : an -qubit control register selects which single-qubit gate acts on…

quant-ph2026

Uniqueness of imaginarity-assisted exact transformation from real orthogonal operations to arbitrary unitary operations

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…

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-ph2025

Clifford+V synthesis for multi-qubit unitary gates

Soichiro Yamazaki, Seiseki Akibue

We developed a general framework for synthesizing target gates by using a finite set of basic gates, which is a crucial step in quantum compilation. When approximating a gate in SU…

quant-ph2025

Existence of universal resource and uselessness of too entangled states for quantum metrology

Rina Miyajima, Yuki Takeuchi, Seiseki Akibue

We show (i) the existence of universal resource states for a certain class of linear Hamiltonians and (ii) the uselessness of highly entangled states for quantum metrology of linea…

quant-ph2025

Asymptotic Gate Count Bounds for Ancilla-Free Single-Qubit Synthesis with Arithmetic Gates

Kaoru Sano, Hayata Morisaki, Seiseki Akibue

We study ancilla-free approximation of single-qubit unitaries by gate sequences over Clifford+, where or their generalization. Let denote th…

quant-ph2025

Optimal ancilla-free Clifford+T synthesis for general single-qubit unitaries

Hayata Morisaki, Kaoru Sano, Seiseki Akibue

We propose two Clifford+ synthesis algorithms that are optimal with respect to -count. The first algorithm, called deterministic synthesis, approximates any single-qubit unit…

quant-ph2025

Duality of extremal quantum states in verification and data hiding

Seiseki Akibue, Yuki Takeuchi

Quantum state verification (QSV) and quantum data hiding (QDH) have so far been studied separately. QSV decides whether a given quantum state is close to the ideal one, with signif…

quant-ph2025

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-ph2024★ 1 cited

Error Crafting in Mixed Quantum Gate Synthesis

Nobuyuki Yoshioka, Seiseki Akibue, Hayata Morisaki +2

In fault-tolerant quantum computing, errors in unitary gate synthesis is comparable with noise inherent in the gates themselves. While mixed synthesis can suppress such coherent er…

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★ 1 cited

Non-locality of conjugation symmetry: characterization and examples in quantum network sensing

Jisho Miyazaki, Seiseki Akibue

Some quantum information processing protocols necessitate quantum operations that are invariant under complex conjugation. In this study, we analyze the non-local resources necessa…

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…

quant-ph2022★ 15 cited

Scalable implementation of mutually unbiased bases for -dimensional quantum key distribution

Takuya Ikuta, Seiseki Akibue, Yuya Yonezu +3

A high-dimensional quantum key distribution (QKD) can improve error rate tolerance and the secret key rate. Many -dimensional QKDs have used two mutually unbiased bases (MUBs),…

quant-ph2022★ 2 cited

Entanglement and Causal Relation in distributed quantum computation

Seiseki Akibue

In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementab…

quant-ph2021

Quadratic improvement on accuracy of approximating pure quantum states and unitary gates by probabilistic implementation

Seiseki Akibue, Go Kato, Seiichiro Tani

Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quant…

quant-ph2018★ 10 cited

Perfect discrimination of non-orthogonal quantum states with posterior classical partial information

Seiseki Akibue, Go Kato, Naoki Marumo

The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measurin…

quant-ph2018★ 4 cited

Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture

Seiseki Akibue, Go Kato

For distinguishing quantum states sampled from a fixed ensemble, the gap in bipartite and single-party distinguishability can be interpreted as a nonlocality of the ensemble. In th…

quant-ph2016★ 8 cited

Entanglement-assisted classical communication can simulate classical communication without causal order

Seiseki Akibue, Masaki Owari, Go Kato +1

Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. Wh…

quant-ph2015★ 20 cited

Network coding for distributed quantum computation over cluster and butterfly networks

Seiseki Akibue, Mio Murao

To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We con…

quant-ph2014★ 7 cited

Two-party LOCC convertibility of quadpartite states and Kraus-Cirac number of two-qubit unitaries

Akihito Soeda, Seiseki Akibue, Mio Murao

Nonlocal properties (globalness) of a non-separable unitary determine how the unitary affects the entanglement properties of a quantum state. We apply a given two-qubit unitary on…