arXiv subjects

Kosuke Fukui

Publications and source records attributed to Kosuke Fukui.

32 records · Page 2Linked to original sources

arXiv2022

Analysis of optical quantum state preparation using photon detectors in the finite-temporal-resolution regime

Quantum state preparation is important for quantum information processing. In particular, in optical quantum computing with continuous variables, non-Gaussian states are needed for universal operation and error correction. Optical non-Gaussian states are usually generated by heralding schemes using photon detectors. In previous experiments, the temporal resolution of the photon detectors was sufficiently high relative to the time width of the quantum state, so that the conventional theory of non-Gaussian state preparation treated the detector's temporal resolution as negligible. However, when using various photon detectors including photon-number-resolving detectors, the temporal resolution is non-negligible. In this paper, we extend the conventional theory of quantum state preparation using photon detectors to the finite temporal resolution regime, analyze the cases of single-photon and two-photon preparation as examples, and find that the generated states are characterized by the dimensionless parameter $B$, defined as the product of the temporal resolution of the detectors $Δt$ and the bandwidth of the light source $Δf$. Based on the results, $B\sim0.1$ is required to keep the purity and fidelity of the generated quantum states high.

quant-ph↗

arXiv2022

Switching-free time-domain optical quantum computation with quantum teleportation

Optical switches and rerouting network are main obstacles to realize optical quantum computer. In particular, both components have been considered as essential components to the measurement-based time-domain optical quantum computation, which has seen promising developments regarding scalability in the recent years. Realizing optical switches and rerouting network with sufficient performance is, however, experimentally challenging as they must have extremely low loss, small switching time, high repetition rate, and minimum optical nonlinearity. In this work, we present an optical quantum computation platform that does not require such optical switches. Our method is based on continuous-variable measurement-based quantum computation, where instead of the typical cluster states, we modify the structure of the quantum entanglements, so that quantum teleportation protocol can be employed instead of the optical switching and rerouting. We also show that when combined with Gottesman-Kitaev-Preskill encoding, our architecture can outperform the architecture with optical switches when the optical losses of the switches are not low.

quant-ph↗

arXiv2022

Building a large-scale quantum computer with continuous-variable optical technologies

Realizing a large-scale quantum computer requires hardware platforms that can simultaneously achieve universality, scalability, and fault tolerance. As a viable pathway to meeting these requirements, quantum computation based on continuous-variable optical systems has recently gained more attention due to its unique advantages and approaches. This review introduces several topics of recent experimental and theoretical progress in the optical continuous-variable quantum computation that we believe are promising. In particular, we focus on scaling-up technologies enabled by time multiplexing, bandwidth broadening, and integrated optics, as well as hardware-efficient and robust bosonic quantum error correction schemes.

quant-ph↗

arXiv2022

Generating Gottesman-Kitaev-Preskill qubit using a cross-Kerr interaction between a squeezed light and Fock states in optics

Gottesman-Kitaev-Preskill (GKP) qubit is a promising ingredient for fault-tolerant quantum computation (FTQC) in optical continuous variables due to its advantage of noise tolerance and scalability. However, one of the main problems in the preparation of the optical GKP qubit is the difficulty in obtaining the nonlinearity. Cross-Kerr interaction is one of the promising candidates for this nonlinearity. There is no existing scheme to use the cross-Kerr interaction to generate the optical GKP qubit for FTQC. In this work, we propose a generation method of the GKP qubit by using a cross-Kerr interaction between a squeezed light and a superposition of Fock states. We numerically show that the GKP qubit with the 10 dB can be generated with a mean fidelities of 99.99 and 99.9% at the success probabilities of 2.7 and 4.8%, respectively. Therefore, our method has potential method to generate the optical GKP qubit with a quality required for FTQC when we obtain the sufficient technologies for the preparation of ancillary Fock states and a cross-Kerr interaction.

quant-ph↗

arXiv2021

Estimation of Gaussian random displacement using non-Gaussian states

In continuous-variable quantum information processing, quantum error correction of Gaussian errors requires simultaneous estimation of both quadrature components of displacements on phase space. However, quadrature operators $x$ and $p$ are non-commutative conjugate observables, whose simultaneous measurement is prohibited by the uncertainty principle. Gottesman-Kitaev-Preskill (GKP) error correction deals with this problem using complex non-Gaussian states called GKP states. On the other hand, simultaneous estimation of displacement using experimentally feasible non-Gaussian states has not been well studied. In this paper, we consider a multi-parameter estimation problem of displacements assuming an isotropic Gaussian prior distribution and allowing post-selection of measurement outcomes. We derive a lower bound for the estimation error when only Gaussian operations are used, and show that even simple non-Gaussian states such as single-photon states can beat this bound. Based on Ghosh's bound, we also obtain a lower bound for the estimation error when the maximum photon number of the input state is given. Our results reveal the role of non-Gaussianity in the estimation of displacements, and pave the way toward the error correction of Gaussian errors using experimentally feasible non-Gaussian states.

quant-ph↗

arXiv2021

Non-Clifford gate on optical qubits by nonlinear feedforward

In a continuous-variable optical system, the Gottesman-Kitaev-Preskill (GKP) qubit is a promising candidate for fault-tolerant quantum computation. To implement non-Clifford operations on GKP qubits, non-Gaussian operations are required. In this context, the implementation of a cubic phase gate by combining nonlinear feedforward with ancillary states has been widely researched. Recently, however, it is pointed out that the cubic phase gate is not the most suitable for non-Clifford operations on GKP qubits. In this work, we show that we can achieve linear optical implementation of non-Clifford operations on GKP qubit with high fidelity by applying the nonlinear feedforward originally developed for the cubic phase gate and using a GKP-encoded ancillary state. Our work shows the versatility of nonlinear feedforward technique important for optical implementation of the fault-tolerant continuous-variable quantum computation.

quant-ph↗

arXiv2021

All-Optical Long-Distance Quantum Communication with Gottesman-Kitaev-Preskill qubits

Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. Repeater protocols that encode information in single- or multi-photon states are limited by transmission losses and the cost of implementing entangling gates or Bell measurements. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill (GKP) qubits. These qubits are natural elements for quantum repeater protocols, because they allow for deterministic Gaussian entangling operations and Bell measurements, which can be implemented at room temperature. The GKP encoding is also capable of correcting small displacement errors. At the cost of additional Gaussian noise, photon loss can be converted into a random displacement error channel by applying a phase-insensitive amplifier. Here we show that a similar conversion can be achieved in two-way repeater protocols by using phase-sensitive amplification applied in the post-processing of the measurement data, resulting in less overall Gaussian noise per (sufficiently short) repeater segment. We also investigate concatenating the GKP code with higher level qubit codes while leveraging analog syndrome data, post-selection, and path-selection techniques to boost the rate of communication. We compute the secure key rates and find that GKP repeaters can achieve a comparative performance relative to methods based on photonic qubits while using orders-of-magnitude fewer qubits.

quant-ph↗

arXiv2021

Wave-function engineering via conditional quantum teleportation with non-Gaussian entanglement resource

We propose and analyze a setup to tailor the wave functions of the quantum states. Our setup is based on the quantum teleportation circuit, but instead of the usual two-mode squeezed state, two-mode non-Gaussian entangled state is used. Using this setup, we can generate various classes of quantum states such as Schrödinger cat states, four-component cat states, superpositions of Fock states, and cubic phase states. These results demonstrate the versatility of our system as a state generator and suggest that conditioning using homodyne measurements is an important tool in the generations of the non-Gaussian states in complementary to the photon number detection.

quant-ph↗

arXiv2020

Temporal-mode continuous-variable 3-dimensional cluster state for topologically-protected measurement-based quantum computation

Measurement-based quantum computation with continuous variables in an optical setup shows the great promise towards implementation of large-scale quantum computation, where the time-domain multiplexing approach enables us to generate the large-scale cluster state used to perform measurement-based quantum computation. To make effective use of the advantage of the time-domain multiplexing approach, in this paper, we propose the method to generate the large-scale 3-dimensional cluster state which is a platform for topologically protected measurement-based quantum computation. Our method combines a time-domain multiplexing approach with a divide-and-conquer approach, and has the two advantages for implementing large-scale quantum computation. First, the squeezing level for verification of the entanglement of the 3-dimensional cluster states is experimentally feasible. The second advantage is the robustness against analog errors derived from the finite squeezing of continuous variables during topologically-protected measurement-based quantum computation. Therefore, our method is a promising approach to implement large-scale quantum computation with continuous variables.

quant-ph↗

arXiv2020

Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code

Scalability of flying photonic quantum systems in generating quantum entanglement offers a potential for implementing large-scale fault-tolerant quantum computation, especially by means of measurement-based quantum computation (MBQC). However, existing protocols for MBQC inevitably impose a polynomial overhead cost in implementing quantum computation due to geometrical constraints of entanglement structures used in the protocols, and the polynomial overhead potentially cancels out useful polynomial speedups in quantum computation. To implement quantum computation without this cancellation, we construct a protocol for photonic MBQC that achieves as low as poly-logarithmic overhead, by introducing an entanglement structure for low-overhead qubit permutation. Based on this protocol, we design a fault-tolerant photonic MBQC protocol that can be performed by experimentally tractable homodyne detection and Gaussian entangling operations combined with the Gottesman-Kitaev-Preskill (GKP) quantum error-correcting code, which we concatenate with the $7$-qubit code. Our fault-tolerant protocol achieves the threshold $7.8$ dB in terms of the squeezing level of the GKP code, outperforming $8.3$ dB of the best existing protocol for fault-tolerant quantum computation with the GKP surface code. Thus, bridging a gap between theoretical progress on MBQC and photonic experiments towards implementing MBQC, our results open a new way towards realization of a large class of quantum speedups including those polynomial.

quant-ph↗

arXiv2018

The tetrazole analogue of the auxin indole-3-acetic acid binds preferentially to TIR1 and not AFB5

Auxin is considered one of the cardinal hormones in plant growth and development. It regulates a wide range of processes throughout the plant. Synthetic auxins exploit the auxin-signalling pathway and are valuable as herbicidal agrochemicals. Currently, despite a diversity of chemical scaffolds all synthetic auxins have a carboxylic acid as the active core group. By applying bio-isosteric replacement we discovered that indole-3-tetrazole was active by surface plasmon resonance (SPR) spectrometry, showing that the tetrazole could initiate assembly of the TIR1 auxin co-receptor complex. We then tested the tetrazole's efficacy in a range of whole plant physiological assays and in protoplast reporter assays which all confirmed auxin activity, albeit rather weak. We then tested indole-3-tetrazole against the AFB5 homologue of TIR1, finding that binding was selective against TIR1, absent with AFB5. The kinetics of binding to TIR1 are contrasted to those for the herbicide picloram, which shows the opposite receptor preference as it binds to AFB5 with far greater affinity than to TIR1. The basis of the preference of indole-3-tetrazole for TIR1 was revealed to be a single residue substitution using molecular docking, and assays using tir1 and afb5 mutant lines confirmed selectivity in vivo. Given the potential that a TIR1-selective auxin might have for unmasking receptor-specific actions, we followed a rational design, lead optimisation campaign and a set of chlorinated indole-3-tetrazoles was synthesised. Improved affinity for TIR1 and the preference for binding to TIR1 was maintained for 4- and 6-chloroindole-3-tetrazoles, coupled with improved efficacy in vivo. This work expands the range of auxin chemistry for the design of receptor-selective synthetic auxins.

q-bio.BM↗

arXiv2018

Tracking Quantum Error Correction

To implement fault-tolerant quantum computation with continuous variables, the Gottesman--Kitaev--Preskill (GKP) qubit has been recognized as an important technological element. We have proposed a method to reduce the required squeezing level to realize large scale quantum computation with the GKP qubit [Phys. Rev. X. {\bf 8}, 021054 (2018)], harnessing the virtue of analog information in the GKP qubits. In the present work, to reduce the number of qubits required for large scale quantum computation, we propose the tracking quantum error correction, where the logical-qubit level quantum error correction is partially substituted by the single-qubit level quantum error correction. In the proposed method, the analog quantum error correction is utilized to make the performances of the single-qubit level quantum error correction almost identical to those of the logical-qubit level quantum error correction in a practical noise level. The numerical results show that the proposed tracking quantum error correction reduces the number of qubits during a quantum error correction process by the reduction rate $\left\{{2(n-1)\times4^{l-1}-n+1}\right\}/({2n \times 4^{l-1}})$ for $n$-cycles of the quantum error correction process using the Knill's $C_{4}/C_{6}$ code with the concatenation level $l$. Hence, the proposed tracking quantum error correction has great advantage in reducing the required number of physical qubits, and will open a new way to bring up advantage of the GKP qubits in practical quantum computation.

quant-ph↗

arXiv2018

High-threshold fault-tolerant quantum computation with analog quantum error correction

To implement fault-tolerant quantum computation with continuous variables, the Gottesman-Kitaev-Preskill (GKP) qubit has been recognized as an important technological element. However,it is still challenging to experimentally generate the GKP qubit with the required squeezing level, 14.8 dB, of the existing fault-tolerant quantum computation. To reduce this requirement, we propose a high-threshold fault-tolerant quantum computation with GKP qubits using topologically protected measurement-based quantum computation with the surface code. By harnessing analog information contained in the GKP qubits, we apply analog quantum error correction to the surface code.Furthermore, we develop a method to prevent the squeezing level from decreasing during the construction of the large scale cluster states for the topologically protected measurement based quantum computation. We numerically show that the required squeezing level can be relaxed to less than 10 dB, which is within the reach of the current experimental technology. Hence, this work can considerably alleviate this experimental requirement and take a step closer to the realization of large scale quantum computation.

quant-ph↗

arXiv2017

Analog quantum error correction with encoding a qubit into an oscillator

To implement fault-tolerant quantum computation with continuous variables, Gottesman-Kitaev-Preskill (GKP) qubits have been recognized as an important technological element. However, the analog outcome of GKP qubits, which includes beneficial information to improve the error tolerance, has been wasted, because the GKP qubits have been treated as only discrete variables. In this paper, we propose a hybrid quantum error correction approach that combines digital information with the analog information of the GKP qubits using the maximum-likelihood method. As an example, we demonstrate that the three-qubit bit-flip code can correct double errors, whereas the conventional method based on majority voting on the binary measurement outcome can correct only a single error. As another example, a concatenated code known as Knill's C4/C6 code can achieve the hashing bound for the quantum capacity of the Gaussian quantum channel. To the best of our knowledge, this approach is the first attempt to draw both digital and analog information from a single quantum state to improve quantum error correction performance.

quant-ph↗