arXiv subjects

Keisuke Fujii

Publications and source records attributed to Keisuke Fujii.

At least 307 records · Page 17Linked to original sources

arXiv2013

Blind quantum computation protocol in which Alice only makes measurements

Blind quantum computation is a new secure quantum computing protocol which enables Alice who does not have sufficient quantum technology 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. In previous protocols, Alice needs to have a device which generates quantum states, such as single-photon states. Here we propose another type of blind computing protocol where Alice does only measurements, such as the polarization measurements with a threshold detector. In several experimental setups, such as optical systems, the measurement of a state is much easier than the generation of a single-qubit state. Therefore our protocols ease Alice's burden. Furthermore, the security of our protocol is based on the no-signaling principle, which is more fundamental than quantum physics. Finally, our protocols are device independent in the sense that Alice does not need to trust her measurement device in order to guarantee the security.

quant-ph↗

arXiv2012

Duality analysis on random planar lattice

The conventional duality analysis is employed to identify a location of a critical point on a uniform lattice without any disorder in its structure. In the present study, we deal with the random planar lattice, which consists of the randomized structure based on the square lattice. We introduce the uniformly random modification by the bond dilution and contraction on a part of the unit square. The random planar lattice includes the triangular and hexagonal lattices in extreme cases of a parameter to control the structure. The duality analysis in a modern fashion with real-space renormalization is found to be available for estimating the location of the critical points with wide range of the randomness parameter. As a simple testbed, we demonstrate that our method indeed gives several critical points for the cases of the Ising and Potts models, and the bond-percolation thresholds on the random planar lattice. Our method leads to not only such an extension of the duality analyses on the classical statistical mechanics but also a fascinating result associated with optimal error thresholds for a class of quantum error correction code, the surface code on the random planar lattice, which known as a skillful technique to protect the quantum state.

cond-mat.dis-nn↗

arXiv2012

Blind topological measurement-based quantum computation

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 experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 0.0043, which is comparable to that (0.0075) of non-blind topological quantum computation. As the error per gate of the order 0.001 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

quant-ph↗

arXiv2012

Measurement-Based Quantum Computation on Symmetry Breaking Thermal States

We consider measurement-based quantum computation (MBQC) on thermal states of the interacting cluster Hamiltonian containing interactions between the cluster stabilizers that undergoes thermal phase transitions. We show that the long-range order of the symmetry breaking thermal states below a critical temperature drastically enhance the robustness of MBQC against thermal excitations. Specifically, we show the enhancement in two-dimensional cases and prove that MBQC is topologically protected below the critical temperature in three-dimensional cases. The interacting cluster Hamiltonian allows us to perform MBQC even at a temperature an order of magnitude higher than that of the free cluster Hamiltonian.

quant-ph↗

arXiv2012

A feasibility study of the measurement of Higgs pair creation at a Photon Linear Collider

We studied the feasibility of the measurement of Higgs pair creation at a Photon Linear Collider (PLC). From the sensitivity to the anomalous self-coupling of the Higgs boson, the optimum $γγ$ collision energy was found to be around 270 GeV for a Higgs mass of 120 GeV/$c^2$. We found that large backgrounds such as $γγ\rightarrow W^+W^-, ZZ,$ and $b\bar{b}b\bar{b}$, can be suppressed if correct assignment of tracks to parent partons is achieved and Higgs pair events can be observed with a statistical significance of $\sim 5 σ$ by operating the PLC for 5 years.

hep-ph↗

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

Little Higgs with T-parity measurements at the ILC

The Littlest Higgs with T-parity Model (LHT) is one of the attractive candidates of physics beyond the Standard Model. In this study we focus on heavy gauge bosons and heavy leptons that LHT imposes, which are detectable at ILC. The mass and couplings of these particles possess important information of the model's mass generation mechanism and how they interact with other particles. Precision measurement will be essential among verifying the model. We will address the measurement accuracy of Little Higgs particle masses, couplings and model parameters at ILC.

hep-ph↗

arXiv2012

A distributed architecture for scalable quantum computation with realistically noisy devices

Tremendous efforts have been paid for realization of fault-tolerant quantum computation so far. However, preexisting fault-tolerant schemes assume that a lot of qubits live together in a single quantum system, which is incompatible with actual situations of experiment. Here we propose a novel architecture for practically scalable quantum computation, where quantum computation is distributed over small-size (four-qubit) local systems, which are connected by quantum channels. We show that the proposed architecture works even with the error probability 0.1% of local operations, which breaks through the consensus by one order of magnitude. Furthermore, the fidelity of quantum channels can be very low $\sim$ 0.7, which substantially relaxes the difficulty of scaling-up the architecture. All key elements and their accuracy required for the present architecture are within reach of current technology. The present architecture allows us to achieve efficient scaling of quantum computer, as has been achieved in today's classical computer.

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

Error- and Loss-Tolerances of Surface Codes with General Lattice Structures

We propose a family of surface codes with general lattice structures, where the error-tolerances against bit and phase errors can be controlled asymmetrically by changing the underlying lattice geometries. The surface codes on various lattices are found to be efficient in the sense that their threshold values universally approach the quantum Gilbert-Varshamov bound. We find that the error-tolerance of surface codes depends on the connectivity of underlying lattices; the error chains on a lattice of lower connectivity are easier to correct. On the other hand, the loss-tolerance of surface codes exhibits an opposite behavior; the logical information on a lattice of higher connectivity has more robustness against qubit loss. As a result, we come upon a fundamental trade-off between error- and loss-tolerances in the family of the surface codes with different lattice geometries.

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↗

arXiv2012

Feasibility study of measurement of Higgs pair creation in a gamma gamma collider

We studied the feasibility of measurement of Higgs pair creation in a gamma gamma collider. We found the optimum collision energy is around 270 GeV from the sensitivity study with Higgs boson mass of 120 GeV/c^2. Main backgrounds are gamma gamma to WW, gamma gamma to ZZ, and gamma gamma to bbbb at the optimum collision energy. The preliminary analysis shows HH could be observed with the statistical significance of about 5 sigma when we chose correct assignment of a track by using color singlet information.

hep-ex↗

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

Discrimination of New Physics Models with the International Linear Collider

The large hadron collider (LHC) is anticipated to provide signals of new physics at the TeV scale, which are likely to involve production of a WIMP dark matter candidate. The international linear collider (ILC) is to sort out these signals and lead us to some viable model of the new physics at the TeV scale. In this article, we discuss how the ILC can discriminate new physics models, taking the following three examples: the inert Higgs model, the supersymmetric model, and the littlest Higgs model with T-parity. These models predict dark matter particles with different spins, 0, 1/2, and 1, respectively, and hence comprise representative scenarios. Specifically, we focus on the pair production process, e+e- -> chi+chi- -> chi0chi0W+W-, where chi0 and chi+- are the WIMP dark matter and a new charged particle predicted in each of these models. We then evaluate how accurately the properties of these new particles can be determined at the ILC and demonstrate that the ILC is capable of identifying the spin of the new charged particle and discriminating these models.

hep-ph↗

arXiv2011

Measuring the top Yukawa coupling at the ILC at sqrt(s) = 500 GeV

We report on the feasibility of the direct measurement of the top Yukawa coupling g_t at the International Linear Collider (ILC) during its first phase of operation with a center-of-mass energy of 500 GeV. The signal and background models incorporate the non-relativistic QCD corrections which enhance the production cross section near the t-tbar threshold. The e+e- -> t tbar H signal is reconstructed in the 6-jet + lepton and the 8-jet modes. The results from the two channels are combined. The background processes considered are e+e- -> t bbar W- / tbar b W+ (which includes e+e- -> t tbar), e+e- -> t tbar Z, and e+e- -> t tbar g* -> t tbar b bar. We use a realistic fast Monte-Carlo detector simulation. Signal events are selected using event shape variables, through jet clustering, and by identifying heavy flavor jets. Assuming a Higgs mass of 120 GeV, polarized electron and positron beams with (Pe-,Pe+) = (-0.8,+0.3), and an integrated luminosity of 1 ab-1, we estimate that the e+e- -> t tbar H events can be seen with a statistical significance of 5.2 sigma, corresponding to the relative top Yukawa coupling measurement accuracy of |Delta g_t / g_t| = 10%.

hep-ph↗

arXiv2011

Robust and Scalable Scheme to Generate Large-Scale Entanglement Webs

We propose a robust and scalable scheme to generate an $N$-qubit $W$ state among separated quantum nodes (cavity-QED systems) by using linear optics and postselections. The present scheme inherits the robustness of the Barrett-Kok scheme [Phys. Rev. A {\bf 71}, 060310(R) (2005)]. The scalability is also ensured in the sense that an arbitrarily large $N$-qubit $W$ state can be generated with a quasi-polynomial overhead $\sim 2^{O[(\log_2 N)^2]}$. The process to breed the $W$ states, which we introduce to achieve the scalability, is quite simple and efficient, and can be applied for other physical systems.

quant-ph↗

arXiv2010

Topological One-Way Quantum Computation on Verified Logical Cluster States

We present a scheme to improve the noise threshold for the fault-tolerant topological one-way computation with a constant overhead. Certain cluster states of finite size, say star clusters, are constructed with logical qubits through an efficient verification process to achieve high fidelity. Then, the star clusters are connected near-deterministically with verification to form a three-dimensional cluster state to implement the topological one-way computation. The necessary postselection for verification is localized within the star clusters, ensuring the salability of computation. This scheme works with a high error rate $ \sim 1 % $ and reasonable resources comparable to or less than those for the other fault-tolerant schemes, suggesting potentially a noise threshold higher than 5%.

quant-ph↗

arXiv2010

Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates

We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the conditional error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional fault-tolerant schemes with probabilistic two-qubit gates.

quant-ph↗