arXiv subjects

Tomoyuki Morimae

Publications and source records attributed to Tomoyuki Morimae.

105 records · Page 6Linked to original sources

arXiv2012

Computational Power and Correlation in Quantum Computational Tensor Network

We investigate relations between computational power and correlation in resource states for quantum computational tensor network, which is a general framework for measurement-based quantum computation. We find that if the size of resource states is finite, not all resource states allow correct projective measurements in the correlation space, which is related to non-vanishing two-point correlations in the resource states. On the other hand, for infinite-size resource states, we can always implement correct projective measurements if the resource state can simulate arbitrary single-qubit rotations, since such a resource state exhibits exponentially-decaying two-point correlations. This implies that a many-body state whose two-point correlation cannot be upperbounded by an exponentially-decaying function cannot simulate arbitrary single-qubit rotations.

quant-ph↗

arXiv2012

Simulation of fault-tolerant quantum circuits on quantum computational tensor network

In the framework of quantum computational tensor network [D. Gross and J. Eisert, Phys. Rev. Lett. {\bf98}, 220503 (2007)], which is a general framework of measurement-based quantum computation, the resource many-body state is represented in a tensor-network form, and universal quantum computation is performed in a virtual linear space, which is called a correlation space, where tensors live. Since any unitary operation, state preparation, and the projection measurement in the computational basis can be simulated in a correlation space, it is natural to expect that fault-tolerant quantum circuits can also be simulated in a correlation space. However, we point out that not all physical errors on physical qudits appear as linear completely-positive trace-preserving errors in a correlation space. Since the theories of fault-tolerant quantum circuits known so far assume such noises, this means that the simulation of fault-tolerant quantum circuits in a correlation space is not so straightforward for general resource states.

quant-ph↗

arXiv2012

Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles

Recently, Li {\it et al.} [Phys. Rev. Lett. {\bf 107}, 060501 (2011)] have demonstrated that topologically protected measurement-based quantum computation can be implemented on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-2 and spin-3/2 particles provided that the temperature is smaller than a critical value, namely, threshold temperature. Here we show that the thermal state of a nearest-neighbor two-body Hamiltonian, which consists of only spin-3/2 particles, allows us to perform topologically protected measurement-based quantum computation. The threshold temperature is calculated and turns out to be comparable to that with the spin-2 and spin-3/2 system. Furthermore, we generally show that a cluster state of high connectivity can be efficiently generated from the thermal state of the spin-3/2 system without severe thermal noise accumulation.

quant-ph↗

arXiv2011

Not all physical errors can be linear CPTP maps in a correlation space

In the framework of quantum computational tensor network, which is a general framework of measurement-based quantum computation, the resource many-body state is represented in a tensor-network form, and universal quantum computation is performed in a virtual linear space, which is called a correlation space, where tensors live. Since any unitary operation, state preparation, and the projection measurement in the computational basis can be simulated in a correlation space, it is natural to expect that fault-tolerant quantum circuits can also be simulated in a correlation space. However, we point out that not all physical errors on physical qudits appear as linear completely-positive trace-preserving errors in a correlation space. Since the theories of fault-tolerant quantum circuits known so far assume such noises, this means that the simulation of fault-tolerant quantum circuits in a correlation space is not so straightforward for general resource states.

quant-ph↗

arXiv2011

Quantum computational tensor network on string-net condensate

The string-net condensate is a new class of materials which exhibits the quantum topological order. In order to answer the important question, "how useful is the string-net condensate in quantum information processing?", we consider the most basic example of the string-net condensate, namely the $Z_2$ gauge string-net condensate on the two-dimensional hexagonal lattice, and show that the universal measurement-based quantum computation (in the sense of the quantum computational webs) is possible on it by using the framework of the quantum computational tensor network. This result implies that even the most basic example of the string-net condensate is equipped with the correlation space that has the capacity for the universal quantum computation.

quant-ph↗

arXiv2011

Ground state blind quantum computation on AKLT state

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 Affleck-Kennedy-Lieb-Tasaki (AKLT) chains leading to more robust computation. AKLT states are physically motivated resource as they are gapped ground states of a physically natural Hamiltonian in condensed matter physics. Our BQC protocol can enjoy the advantages of AKLT resource states, such as the cooling preparation of the resource state, the energy-gap protection of the quantum computation, and the simple and efficient preparation of the resource state in linear optics with biphotons.

quant-ph↗

arXiv2010

Entanglement-fidelity relations for inaccurate ancilla-driven quantum computation

It was shown in [T. Morimae, Phys. Rev. A {\bf81}, 060307(R) (2010)] that the gate fidelity of an inaccurate one-way quantum computation is upper bounded by a decreasing function of the amount of entanglement in the register. This means that a strong entanglement causes the low gate fidelity in the one-way quantum computation with inaccurate measurements. In this paper, we derive similar entanglement-fidelity relations for the inaccurate ancilla-driven quantum computation. These relations again imply that a strong entanglement in the register causes the low gate fidelity in the ancilla-driven quantum computation if the measurements on the ancilla are inaccurate.

quant-ph↗

arXiv2010

How to upload a physical state to the correlation space

In the framework of the computational tensor network [D. Gross and J. Eisert, Phys. Rev. Lett. {\bf98}, 220503 (2007)], the quantum computation is performed in a virtual linear space which is called the correlation space. It was recently shown [J. M. Cai, W, Dür, M. Van den Nest, A. Miyake, and H. J. Briegel, Phys. Rev. Lett. {\bf103}, 050503 (2009)] that a state in the correlation space can be downloaded to the real physical space. In this letter, conversely, we study how to upload a state from a real physical space to the correlation space being motivated by the virtual-real hybrid quantum information processing. After showing the impossibility of the cloning of a state between the real physical space and the correlation space, we propose a simple teleportation-like method of the upload. Applications of this method also enable the Gottesman-Chuang gate teleportation trick and the entanglement swapping in the virtual-real hybrid setting. Furthermore, compared with the inverse of the downloading method by Cai, et. al., which also works as the upload, our uploading method has several advantages.

quant-ph↗

arXiv2010

Strong entanglement causes low gate fidelity in inaccurate one-way quantum computation

We study how entanglement among the register qubits affects the gate fidelity in the one-way quantum computation if a measurement is inaccurate. We derive an inequality which shows that the mean gate fidelity is upper bounded by a decreasing function of the magnitude of the error of the measurement and the amount of the entanglement between the measured qubit and other register qubits. The consequence of this inequality is that, for a given amount of entanglement, which is theoretically calculated once the algorithm is fixed, we can estimate from this inequality how small the magnitude of the error should be in order not to make the gate fidelity below a threshold, which is specified by a technical requirement in a particular experimental setup or by the threshold theorem of the fault-tolerant quantum computation.

quant-ph↗

arXiv2010

Vacuum entanglement governs the bosonic character of magnons

It is well known that magnons, elementary excitations in a magnetic material, behave as bosons when their density is low. We study how the bosonic character of magnons is governed by the amount of a multipartite entanglement in the vacuum state on which magnons are excited. We show that if the multipartite entanglement is strong, magnons cease to be bosons. We also consider some examples, such as ground states of the Heisenberg ferromagnet and the transverse Ising model, the condensation of magnons, the one-way quantum computer, and Kitaev's toric code. Our result provides insights into the quantum statistics of elementary excitations in these models, and into the reason why a non-local transformation, such as the Jordan-Wigner transformation, is necessary for some many-body systems.

quant-ph↗

arXiv2010

Low-temperature coherence properties of Z_2 quantum memory

We investigate low-temperature coherence properties of the Z_2 quantum memory which is capable of storing the information of a single logical qubit. We show that the memory has superposition of macroscopically distinct states for some values of a control parameter and at sufficiently low temperature, and that the code states of this memory have no instability except for the inevitable one. However, we also see that the coherence power of this memory is limited by space and time. We also briefly discuss the RVB memory, which is an improvement of the Z_2 quantum memory, and the relations of our results to the obscured symmetry breaking in statistical physics.

quant-ph↗

arXiv2009

Superposition of macroscopically distinct states means large multipartite entanglement

We show relations between superposition of macroscopically distinct states and entanglement. These relations lead to the important conclusion that if a state contains superposition of macroscopically distinct states, the state also contains large multipartite entanglement in terms of several measures. Such multipartite entanglement property also suggests that if a state contains superposition of macroscopically distinct states, a measurement on a single particle drastically changes the state of macroscopically many other particles, as in the case of the N-qubit GHZ state.

quant-ph↗

arXiv2009

Necessity of macroscopic operation for the creation of superpositions of macroscopically distinct states

We consider the creation of superpositions of macroscopically distinct states by a completely-positive (CP) operation on a subsystem. We conclude that the subsystem on which the CP operation acts must be macroscopically large if the success probability of the CP operation does not vanish in the thermodynamic limit. In order to obtain this conclusion, we show two inequalities each of which represents a trade-off relation among the magnitude of an indicator for superpositions of macroscopically distinct states, the success probability of a CP operation, and the volume of the subsystem on which the CP operation acts.

quant-ph↗

arXiv2006

Visualization of superposition of macroscopically distinct states

We propose a method of visualizing superpositions of macroscopically distinct states in many-body pure states. We introduce a visualization function, which is a coarse-grained quasi joint probability density for two or more hermitian additive operators. If a state contains superpositions of macroscopically distinct states, one can visualize them by plotting the visualization function for appropriately taken operators. We also explain how to efficiently find appropriate operators for a given state. As examples, we visualize four states containing superpositions of macroscopically distinct states: the ground state of the XY model, that of the Heisenberg antiferromagnet, a state in Shor's factoring algorithm, and a state in Grover's quantum search algorithm. Although the visualization function can take negative values, it becomes non-negative (hence becomes a coarse-grained joint probability density) if the characteristic width of the coarse-graining function used in the visualization function is sufficiently large.

quant-ph↗

arXiv2004

Macroscopic entanglement of many-magnon states

We study macroscopic entanglement of various pure states of a one-dimensional N-spin system with N>>1. Here, a quantum state is said to be macroscopically entangled if it is a superposition of macroscopically distinct states. To judge whether such superposition is hidden in a general state, we use an essentially unique index p: A pure state is macroscopically entangled if p=2, whereas it may be entangled but not macroscopically if p<2. This index is directly related to the stability of the state. We calculate the index p for various states in which magnons are excited with various densities and wavenumbers. We find macroscopically entangled states (p=2) as well as states with p=1. The former states are unstable in the sense that they are unstable against some local measurements. On the other hand, the latter states are stable in the senses that they are stable against local measurements and that their decoherence rates never exceed O(N) in any weak classical noises. For comparison, we also calculate the von Neumann entropy S(N) of a subsystem composed of N/2 spins as a measure of bipartite entanglement. We find that S(N) of some states with p=1 is of the same order of magnitude as the maximum value N/2. On the other hand, S(N) of the macroscopically entangled states with p=2 is as small as O(log N)<< N/2. Therefore, larger S(N) does not mean more instability. We also point out that these results are analogous to those for interacting many bosons. Furthermore, the origin of the huge entanglement, as measured either by p or S(N), is discussed to be due to the spatial propagation of magnons.

quant-ph↗