#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2005

2017

- This year (3)
- Last 5 years (26)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Keisuke Fujii, Tomoyuki Morimae
- ArXiv
- 2013

Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy (PH) collapses at the… (More)

- Tomoyuki Morimae, Keisuke Fujii
- Nature communications
- 2012

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle… (More)

- Tomoyuki Morimae, Harumichi Nishimura
- Quantum Information & Computation
- 2016

- Tomoyuki Morimae, Keisuke Fujii, Joseph Fitzsimons
- Physical review letters
- 2014

Deterministic quantum computation with one quantum bit (DQC1) [E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998)] is a model of quantum computing where the input is restricted to containing a single qubit in a pure state and has all other qubits in a completely mixed state. Only the single pure qubit is measured at the end of the computation. While… (More)

- Tomoyuki Morimae
- Physical review letters
- 2012

Blind quantum computation is a secure delegated quantum computing protocol where Alice, who does not have sufficient quantum technology at her disposal, delegates her computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output, and algorithm. Protocols of blind quantum computation… (More)

- Tomoyuki Morimae, Vedran Dunjko, Elham Kashefi
- Quantum Information & Computation
- 2015

The blind quantum computing protocols (BQC) enable a classical client with limited quantum technology to delegate a computation to the quantum server(s) in such a way that the privacy of the computation is preserved. Here we present a new scheme for BQC that uses the concept of the measurement based quantum computing with the novel resource state of… (More)

- Vittorio Giovannetti, Lorenzo Maccone, Tomoyuki Morimae, Terry G Rudolph
- Physical review letters
- 2013

We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational… (More)

- Tomoyuki Morimae, Daniel Nagaj, Norbert Schuch
- ArXiv
- 2015

QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical complexity class NP (and its probabilistic variant MA, Merlin-Arthur games), where the verifier has only classical… (More)

This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0 state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor intermediate measurements. The main results of this paper are… (More)

- Tomoyuki Morimae, Keisuke Fujii
- Physical review letters
- 2013

Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully fledged quantum computer, in such a way that the server cannot learn anything about the client's input, output, and program. If the client… (More)