arXiv subjects

Yuki Takeuchi

Publications and source records attributed to Yuki Takeuchi.

51 records · Page 3Linked to original sources

arXiv2019

Quantum key distribution with simply characterized light sources

To guarantee the security of quantum key distribution (QKD), several assumptions on light sources must be satisfied. For example, each random bit information is precisely encoded on an optical pulse and the photon-number probability distribution of the pulse is exactly known. Unfortunately, however, it is hard to check if all the assumptions are really met in practice, and it is preferable that we have minimal number of device assumptions. In this paper, we adopt the differential-phase-shift (DPS) QKD protocol and drastically mitigate the requirements on light sources. Specifically, we only assume the independence among emitted pulses, the independence of the vacuum emission probability from a chosen bit, and upper bounds on the tail distribution function of the total photon number in a single block of pulses for single, two and three photons. Remarkably, no other detailed characterizations, such as the amount of phase modulation, are required. Our security proof significantly relaxes demands for light sources, which paves a route to guarantee implementation security with simple verification of the devices.

quant-ph↗

arXiv2019

Verifying commuting quantum computations via fidelity estimation of weighted graph states

The instantaneous quantum polynomial time model (or the IQP model) is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some unproven conjectures). In order to experimentally demonstrate the advantage using medium or large-scale IQP circuits, it is inevitable to efficiently verify whether the constructed IQP circuits faithfully work. There exists two types of IQP models, each of which is the sampling on hypergraph states or weighted graph states. For the first-type IQP model, polynomial-time verification protocols have already been proposed. In this paper, we propose verification protocols for the second-type IQP model. To this end, we propose polynomial-time fidelity estimation protocols of weighted graph states for each of the following four situations where a verifier can (i) choose any measurement basis and perform adaptive measurements, (ii) only choose restricted measurement bases and perform adaptive measurements, (iii) choose any measurement basis and only perform non-adaptive measurements, and (iv) only choose restricted measurement bases and only perform non-adaptive measurements. In all of our verification protocols, the verifier's quantum operations are only single-qubit measurements. Since we assume no i.i.d. property on quantum states, our protocols work in any situation.

quant-ph↗

arXiv2018

Impossibility of blind quantum sampling for classical client

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 input, output, and program are hidden from the server. It is an open problem whether a completely classical client can delegate quantum computing blindly. In this paper, we show that if a completely classical client can blindly delegate sampling of subuniversal models, such as the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses to the third level. Our delegation protocol is the one where the client first sends a polynomial-length bit string to the server and then the server returns a single bit to the client. Generalizing the no-go result to more general setups is an open problem.

quant-ph↗

arXiv2018

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy

We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore it is in the second level of the Fourier hierarchy. We show that output probability distributions of the HC1Q model cannot be classically efficiently sampled within a multiplicative error unless the polynomial-time hierarchy collapses to the second level. The proof technique is different from those used for previous sub-universal models, such as IQP, Boson Sampling, and DQC1, and therefore the technique itself might be useful for finding other sub-universal models that are hard to classically simulate. We also study the classical verification of quantum computing in the second level of the Fourier hierarchy. To this end, we define a promise problem, which we call the probability distribution distinguishability with maximum norm (PDD-Max). It is a promise problem to decide whether output probability distributions of two quantum circuits are far apart or close. We show that PDD-Max is BQP-complete, but if the two circuits are restricted to some types in the second level of the Fourier hierarchy, such as the HC1Q model or the IQP model, PDD-Max has a Merlin-Arthur system with quantum polynomial-time Merlin and classical probabilistic polynomial-time Arthur.

quant-ph↗

arXiv2018

One-way transfer of quantum states via decoherence

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 approaches to implement the quantum state transfer rely on unitary evolutions or measurement feedforward operations. However, these existing schemes require accurate pulse operations and/or precise timing controls. Here, we propose a one-way transfer of the quantum state with near unit efficiency using dissipation from a tailored environment. After preparing an initial state, the transfer can be implemented without external time dependent operations. Moreover, our scheme is irreversible due to the non-unitary evolution, and so the transferred state remains in the same site once the system reaches the steady state. This is in stark contrast to the unitary state transfer where the quantum states continue to oscillate between different sites. Our novel quantum state transfer via the dissipation paves the way towards robust and practical quantum control.

quant-ph↗

arXiv2018

Verification of Many-Qubit States

Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli operators. First, we introduce a protocol for verifying ground states of Hamiltonians. We next explain how to verify quantum states generated by a certain class of quantum circuits. We finally propose an adaptive test of stabilizers that enables the verification of all polynomial-time-generated hypergraph states, which include output states of the Bremner-Montanaro-Shepherd-type instantaneous quantum polynomial time (IQP) circuits. Importantly, we do not make any assumption that the identically and independently distributed copies of the same states are given: Our protocols work even if some highly complicated entanglement is created among copies in any artificial way. As applications, we consider the verification of the quantum computational supremacy demonstration with IQP models, and verifiable blind quantum computing.

quant-ph↗

arXiv2018

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

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 can only perform polynomial-time classical (i.e., non-quantum) computation. Understanding the computational power of this model, which corresponds to polynomial-time quantum computation that can be efficiently verified classically, is a well-known open problem in quantum computing. Our result shows that computing the order of a solvable group, which is one of the most general problems for which quantum computing exhibits an exponential speed-up with respect to classical computing, can be realized in this model.

quant-ph↗

arXiv2018

Optimal nonlocal conversion of photonic four-partite entanglement from two Bell pairs in quantum networks

We analyze optimal schemes and also propose some practical schemes for the nonlocal conversion from two shared Bell pairs to four-qubit entangled states in optical quantum networks. In the analysis, we consider two-qubit operations as nonlocal operations and minimize the number of access to ancillary qubits as possible. First, we consider two-qubit unitary operations without using ancillary qubits and derive a necessary and sufficient condition for convertible states. Second, we consider nonlocal optical systems composed of passive linear optics and postselection. For the passive linear optical systems, we derive achievable upper bounds of success probabilities of the conversion in the case without ancillary qubits. We also compare the optimal success probabilities with those of previously proposed schemes. Finally, we discuss success probabilities of the conversion in the case with ancillary qubits.

quant-ph↗

arXiv2017

Fault-tolerant verifiable blind quantum computing with logical state remote preparation

Verifiable blind quantum computing allows a client with poor quantum devices to delegate universal quantum computing to a remote quantum server in such a way that the client's privacy is protected and the honesty of the server is verified. In existing protocols, the client has to send single-qubit states to the server. These states might be decohered by the channel noise. Furthermore, the client hides some "trap" qubits in the server's register so that the client can detect the server's deviation. In reality, however, these trap qubits are disturbed by imperfect operations by the server, which reduces the probability that the client accepts the honest server. To solve these problems, we propose a new gadget that allows the client to remotely prepare encoded logical single-qubit states in the server's place. Importantly, in our fault-tolerant verifiable blind quantum computing protocol, the client needs only the ability of physical single-qubit measurements in $X$ and $Z$ bases.

quant-ph↗

arXiv2017

Information-theoretic security proof of differential-phase-shift quantum key distribution protocol based on complementarity

We show the information-theoretic security proof of the differential-phase-shift (DPS) quantum key distribution (QKD) protocol based on the complementarity approach [arXiv:0704.3661 (2007)]. Our security proof provides a slightly better key generation rate compared to the one derived in the previous security proof in [arXiv:1208.1995 (2012)] that is based on the Shor-Preskill approach [Phys. Rev. Lett. ${\bf 85}$, 441 (2000)]. This improvement is obtained because the complementarity approach can employ more detailed information on Alice's sending state in estimating the leaked information to an eavesdropper. Moreover, we remove the necessity of the numerical calculation that was needed in the previous analysis to estimate the leaked information. This leads to an advantage that our security proof enables us to evaluate the security of the DPS protocol with any block size. This paper highlights one of the fundamental differences between the Shor-Preskill and the complementarity approaches.

quant-ph↗

arXiv2017

Verified measurement-based quantum computing with hypergraph states

Hypergraph states are generalizations of graph states where controlled-$Z$ gates on edges are replaced with generalized controlled-$Z$ gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states with a constant $L$1-norm error unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying hypergraph states with only sequential single-qubit Pauli measurements. As applications, we consider verified blind quantum computing with hypergraph states, and quantum supremacy demonstrations with hypergraph states.

quant-ph↗

arXiv2017

Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy

Instantaneous quantum polynomial time (IQP) is a model of (probably) non-universal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the $l_1$ norm, IQP is considered as one of the promising classes that demonstrates quantum supremacy. Although IQP circuits can be realized more easily than a universal quantum computer, demonstrating quantum supremacy is still difficult. It is therefore desired to find subclasses of IQP that are easy to implement. In this paper, by imposing some restrictions on IQP, we propose ancilla-driven IQP (ADIQP) as the subclass of commuting quantum computation suitable for many experimental settings. We show that even though ADIQP circuits are strictly weaker than IQP circuits in a sense, they are also hard to simulate classically up to a multiplicative error and an error in the $l_1$ norm. Moreover, the properties of ADIQP make it easy to investigate the verifiability of ADIQP circuits and the difficulties in realizing ADIQP circuits.

quant-ph↗

arXiv2016

Observation of optomechanical coupling in a microbottle resonator

In this work, we report optomechanical coupling, resolved sidebands and phonon lasing in a solid-core microbottle resonator fabricated on a single mode optical fiber. Mechanical modes with quality factors (Q_m) as high as 1.57*10^4 and 1.45*10^4 were observed, respectively, at the mechanical frequencies f_m=33.7 MHz and f_m=58.9 MHz. The maximum f_m*Q_m~0.85*10^12 Hz is close to the theoretical lower bound of 6*10^12 Hz needed to overcome thermal decoherence for resolved-sideband cooling of mechanical motion at room temperature, suggesting microbottle resonators as a possible platform for this endeavor. In addition to optomechanical effects, scatter-induced mode splitting and ringing phenomena, which are typical for high-quality optical resonances, were also observed in a microbottle resonator.

physics.optics↗

arXiv2016

Stimulated Brillouin scattering and Brillouin-coupled four-wave-mixing in a silica microbottle resonator

We report the first observation of stimulated Brillouin scattering (SBS) with Brillouin lasing, and Brillouin-coupled four-wave-mixing (FWM) in an ultra-high-Q silica microbottle resonator. The Brillouin lasing was observed at the frequency of $Ω_B=2π\times10.4$ GHz with a threshold power of $0.45$ mW. Coupling between Brillouin and FWM was observed in both backward and forward scattering directions with separations of $2Ω_B$. At a pump power of $10$ mW, FWM spacing reached to 7th and 9th order anti-Stokes and Stokes, respectively.

physics.optics↗

arXiv2016

Blind quantum computation over a collective-noise channel

Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and outputs. The quantum channel between Alice and Bob is noisy, and the loss over the long-distance quantum communication should also be taken into account. Here we propose to use decoherence-free subspace (DFS) to overcome the collective noise in the quantum channel for BQC, which we call DFS-BQC. We propose three variations of DFS-BQC protocols. One of them, a coherent-light-assisted DFS-BQC protocol, allows Alice to faithfully send the signal photons with a probability proportional to a transmission rate of the quantum channel. In all cases, we combine the ideas based on DFS and the Broadbent-Fitzsimons-Kashefi protocol, which is one of the BQC protocols, without degrading unconditional security. The proposed DFS-based schemes are generic and hence can be applied to other BQC protocols where Alice sends quantum states to Bob.

quant-ph↗