activity
20152026
most citedVerification of Many-Qubit States

84 citations · 619 across the 35 of their papers we have counts for

collaborators
Showing 2018Show all

6 papers · 1 filter

quant-ph2018★ 1 cited

Impossibility of blind quantum sampling for classical client

Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi +1

Blind quantum computing enables a client, who can only generate or measure single-qubit states, to delegate quantum computing to a remote quantum server in such a way that the inpu…

quant-ph2018★ 34 cited

Quantum remote sensing with asymmetric information gain

Yuki Takeuchi, Yuichiro Matsuzaki, Koichiro Miyanishi +2

Typically, the aim of quantum metrology is to sense target fields with high precision utilizing quantum properties. Unlike the typical aim, in this paper, we use quantum properties…

quant-ph2018★ 1 cited

One-way transfer of quantum states via decoherence

Yuichiro Matsuzaki, Victor M. Bastidas, Yuki Takeuchi +2

In many quantum information processing applications, it is important to be able to transfer a quantum state from one location to another - even within a local device. Typical appro…

quant-ph2018★ 3 cited

Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements

Yuki Takeuchi, Tomoyuki Morimae, Masahito Hayashi

Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether…

quant-ph2018★ 59 cited

Resource-efficient verification of quantum computing using Serfling's bound

Yuki Takeuchi, Atul Mantri, Tomoyuki Morimae +2

Verifying quantum states is central to certifying the correct operation of various quantum information processing tasks. In particular, in measurement-based quantum computing, chec…

quant-ph2018★ 1 cited

Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups

François Le Gall, Tomoyuki Morimae, Harumichi Nishimura +1

In this paper we consider what can be computed by a user interacting with a potentially malicious server, when the server performs polynomial-time quantum computation but the user…