Sequential and Programmable Squeezing Gates for Optical Non-Gaussian Input States

Generation of high fidelity photonic non-Gaussian states is a crucial\ningredient for universal quantum computation using continous-variable\nplatforms, yet it remains a challenge to do so efficiently. We present a\ngeneral framework for a probabilistic production of multimode non-Gaussian\nstates by measuring few modes of multimode Gaussian states via\nphoton-number-resolving detectors. We use Gaussian elements consisting of\nsqueezed displaced vacuum states and interferometers, the only non-Gaussian\nelements consisting of photon-number-resolving detectors. We derive analytic\nexpressions for the output Wigner function, and the probability of generating\nthe states in terms of the mean and the covariance matrix of the Gaussian state\nand the photon detection pattern. We find that the output states can be written\nas a Fock basis superposition state followed by a Gaussian gate, and we derive\nexplicit expressions for these parameters. These analytic expressions show\nexactly what non-Gaussian states can be generated by this probabilistic scheme.\nFurther, it provides a method to search for the Gaussian circuit and\nmeasurement pattern that produces a target non-Gaussian state with optimal\nfidelity and success probability. We present specific examples such as the\ngeneration of cat states, ON states, Gottesman-Kitaev-Preskill states, NOON\nstates and bosonic code states. The proposed framework has potential\nfar-reaching implications for the generation of bosonic error-correction codes\nthat require non-Gaussian states, resource states for the implementation of\nnon-Gaussian gates needed for universal quantum computation, among other\napplications requiring non-Gaussianity. The tools developed here could also\nprove useful for the quantum resource theory of non-Gaussianity.\n

Quantum information and quantum computing offer a new range of possibilities in terms ofnew computing algorithms, the ability to perform new types of operations and make statementsabout information in terms of what it is physically possible to know about a system.Experiments in quantum information and quantum computing have been advancing significantly,especially over the last decade. In optical quantum computing there are two maintypes of experiments that are performed today. They are experiments involving single photonswith information encoded on the polarisation of the photon and experiments involvingstates with Gaussian noise profiles in their quadratures. There appears to be no way toperform the required operations for universal quantum computing using operations whichtake Gaussian states to Gaussian states. Universal quantum computing using single photonsis possible but uses either enormously large non-linearities or a large number of resources.Also, operations which take Gaussian states to non-Gaussian states are not well understoodin general and can often be very difficult to implement.This thesis presents three sources of optical non-Gaussian states which demonstrate someof the interesting properties of these states. First, a scheme for universal quantum computingusing superpositions of coherent states is presented. Error correction and the fault toleranceproperties of this scheme is also explored and compared with current single photon architectures.These gates require superpositions of coherent states as resources and a relativelysimple scheme is shown for how these states may be generated. Next a scheme for distillingnear ideal Gaussian entanglement using non-Gaussian operations is presented. The loss andnoise conditions under which ideal distillation can be achieved are presented. Finally, a verysimple way of generating mixed non-Gaussian states from two Gaussian states is presented.These states are shown to give rise to counter-intuitive results when measuring their entanglementand when analysing their operational ability in terms of teleportation and quantumkey distribution.

We report advances in time-domain continuous-variable photonic quantum computing, demonstrating a programmable quantum processor capable of processing non-Gaussian states and a programmable quantum light source that generates various non-Gaussian states with arbitrary temporal waveforms, both crucial for universal quantum computation.

The implementation of large-scale universal quantum computation represents a challenging and ambitious task on the road to quantum processing of information. In recent years, an intermediate approach has been pursued to demonstrate quantum computational advantage via non-universal computational models. A relevant example for photonic platforms has been provided by the Boson Sampling paradigm and its variants, which are known to be computationally hard while requiring at the same time only the manipulation of the generated photonic resources via linear optics and detection. Beside quantum computational advantage demonstrations, a promising direction towards possibly useful applications can be found in the field of quantum machine learning, considering the currently almost unexplored intermediate scenario between non-adaptive linear optics and universal photonic quantum computation. Here, we report the experimental implementation of quantum machine learning protocols by adding adaptivity via post-selection to a Boson Sampling platform based on universal programmable photonic circuits fabricated via femtosecond laser writing. Our experimental results demonstrate that Adaptive Boson Sampling is a viable route towards dimension-enhanced quantum machine learning with linear optical devices.

Universal quantum computing with continuous variables requires non-Gaussian resources, in addition to a Gaussian set of operations. A known resource enabling universal quantum computation is the cubic phase state, a non-Gaussian state whose experimental implementation has so far remained elusive. In this paper, we introduce two Gaussian conversion protocols that allow for the conversion of a non-Gaussian state that has been achieved experimentally, namely the trisqueezed state [Chang et al., Phys. Rev. X 10, 011011 (2020)], to a cubic phase state. The first protocol is deterministic and it involves active (inline) squeezing, achieving large fidelities that saturate the bound for deterministic Gaussian protocols. The second protocol is probabilistic and it involves an auxiliary squeezed state, thus removing the necessity of inline squeezing but still maintaining significant success probabilities and fidelities even larger than for the deterministic case. The success of these protocols provides strong evidence for using trisqueezed states as resources for universal quantum computation.

To see the feasibility of a large-scale quantum computing, it is required to accurately analyze the performance and the quantum resource. However, most of the analysis reported so far have focused on the statistical examination, i.e., simply calculating the performance and resource based on individual data, and even worse usually only a few components have been considered. In this work, to achieve more exact analysis, we propose an integrated analysis method for a practical quantum computing model with three components (\textit{algorithm}, \textit{error correction} and \textit{device}) under a realistic quantum computer system architecture. To implement the above method, we develop a quantum computing framework composed of three functional layers: compile, system and building block. This framework can support, for the first time, the mapping of quantum algorithm from physical qubit level to system architecture level with a given fault-tolerant scheme. Therefore, the proposed method can measure the effect of dynamic situation when the quantum computer practically runs. By using our method, we found that Shor algorithm to factorize 512-bit integer requires $8.78\times 10^ 5$ hours. We also show how the proposed method can be used for analyzing optimal concatenation level and code distance of fault-tolerant quantum computing.

We demonstrate a programmable and multi-step squeezing gate on an optical non-Gaussian state by using a loop-based optical circuit, which paves the way for universal large-scale quantum computing.

Classical simulations of real-space quantum dynamics are challenging due to the exponential scaling of computational cost with system dimensions. Quantum computers offer the potential to simulate quantum dynamics with polynomial complexity; however, existing quantum algorithms based on the split-operator techniques require large-scale fault-tolerant quantum computers that remain elusive in the near future. Here, we present variational simulations of real-space quantum dynamics suitable for implementation in noisy intermediate-scale quantum (NISQ) devices. The Hamiltonian is first encoded onto qubits using a discrete variable representation and binary encoding scheme. We show that direct application of a real-time variational quantum algorithm based on the McLachlan's principle is inefficient as the measurement cost grows exponentially with the qubit number for general potential energy, and an extremely small time-step size is required to achieve accurate results. Motivated by the insights that many chemical dynamics occur in the low-energy subspace, we propose a subspace expansion method by projecting the total Hamiltonian, including the time-dependent driving field, onto the system low-energy eigenstate subspace using quantum computers, and the exact quantum dynamics within the subspace can then be solved classically. We show that the measurement cost of the subspace approach grows polynomially with dimensionality for general potential energy. Our numerical examples demonstrate the capability of our approach, even under intense laser fields. Our work opens the possibility of simulating chemical dynamics with NISQ hardware.

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 (QC) 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 QC 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.

Quantum computing becomes viable when a quantum state can be protected from environment-induced error. If quantum bits (qubits) are sufficiently reliable, errors are sparse and quantum error correction (QEC) is capable of identifying and correcting them. Adding more qubits improves the preservation of states by guaranteeing that increasingly larger clusters of errors will not cause logical failure-a key requirement for large-scale systems. Using QEC to extend the qubit lifetime remains one of the outstanding experimental challenges in quantum computing. Here we report the protection of classical states from environmental bit-flip errors and demonstrate the suppression of these errors with increasing system size. We use a linear array of nine qubits, which is a natural step towards the two-dimensional surface code QEC scheme, and track errors as they occur by repeatedly performing projective quantum non-demolition parity measurements. Relative to a single physical qubit, we reduce the failure rate in retrieving an input state by a factor of 2.7 when using five of our nine qubits and by a factor of 8.5 when using all nine qubits after eight cycles. Additionally, we tomographically verify preservation of the non-classical Greenberger-Horne-Zeilinger state. The successful suppression of environment-induced errors will motivate further research into the many challenges associated with building a large-scale superconducting quantum computer.

The Google Quantum AI team's long-term goal is to realize a large-scale fault-tolerant quantum computer. Of the technologies available to implement the quantum processor at the core of such a system, solid-state superconducting circuits based on Josephson junctions (JJs) are among the strongest contenders. Recent demonstrations with this technology include computation beyond the capabilities of today's most powerful supercomputers [1] and execution of quantum error correction (QEC) codes that can detect and correct either bit or phase flip errors [2]. These exciting results were enabled by low-error-rate quantum processors with tens of qubits and the supporting infrastructure to run these devices. However, today's quantum computers still have orders of magnitude fewer qubits than is required for a useful fault-tolerant quantum computer; for this, an estimated million or more qubits will be needed and scaling-up today's technology to this extent is non-trivial. Here, we review the Google Quantum AI team's recent progress and future plans. Specifically, we describe our post-classical Sycamore quantum computer and discuss the Google Quantum AI roadmap to fault-tolerant quantum computing.

Interacting many-body quantum systems and their dynamics, while fundamental to modern science and technology, are formidable to simulate and understand. However, by discovering their symmetries, conservation laws, and integrability, one can unravel their intricacies. Here, using up to 124 qubits of a fully programmable quantum computer, we uncover local conservation laws and integrability in one- and two-dimensional periodically-driven spin lattices in a regime previously inaccessible to such detailed analysis. We focus on the paradigmatic example of disorder-induced ergodicity breaking, where we first benchmark the system crossover into a localized regime through anomalies in the one-particle-density-matrix spectrum and other hallmark signatures. We then demonstrate that this regime stems from hidden local integrals of motion by faithfully reconstructing their quantum operators, thus providing a more detailed portrait of the system’s integrable dynamics. Our results demonstrate a versatile strategy for extracting the hidden dynamical structure from noisy experiments on large-scale quantum computers.

Quantum computing has the capability of parallel computing and is superior to classical computing in solving some specific problems. Once a large-scale quantum computer is developed, the security of classical cryptographic algorithms and protocols, which is based on the assumption of computational complexity, will be severely challenged. Quantum cryptography is a new cryptosystem; its security is based on the principles of quantum mechanics, and can resist the attack of quantum computing. This paper focuses on the nearly 40 years development of quantum cryptographic protocols, including quantum key distribution (QKD), quantum secure direct communication, quantum secret sharing, quantum identity authentication, two-party secure computation, and quantum private query, and summarizes the problems in the process of development. The analysis shows that the quantum cryptographic protocols are in an unbalanced state: QKD is far ahead of other protocols and other protocols are difficult to achieve breakthroughs. In the future, practical quantum protocols for digital signature and two-party secure computation are core issues that needs to be addressed urgently. Therefore, research on quantum and post-quantum cryptography should be conducted synchronously, cross-over study and talent cultivation for the quantum science and cryptography disciplines should be strengthened, and the examination and evaluation mechanism of relevant basic research needs to be optimized.

There are a number of systems that are currently being considered as candidates for the construction of qubits, quantum logic gates and quantum computers. Some of the systems, notably atoms in magnetic traps and nuclear magnetic resonance (NMR) systems, have had some success in performing the elementary operations that would be required in large-scale quantum computer. However, these systems are not necessarily seen as viable technologies for quantum computing in the longer term. The recent demonstration of macroscopic coherence in a superconducting ring (consisting of a thick superconducting ring containing one or more Josephson weak link devices) has added significant weight to the idea of using superconducting persistent current devices (SQUIDs) in quantum logic systems. In this paper, we consider one aspect of the quantum mechanical SQUID, the nonlinear effect of SQUID on the classical control parameters, and we discuss how it may influence the construction and design of quantum logic gates based on SQUID devices. In particular, we look at problems associated with fixing the classical magnetic flux bias for a quantum mechanical SQUID at, or near, a quantum mechanical transition or resonance.

Active quantum error correction has been identified as a crucial ingredient of future quantum computers, motivating the recent experimental efforts to encode logical quantum bits using small topological codes. In addition to the demonstration of the beneficial role of the encoding, a break-even point in the progress towards large-scale quantum computers will be the implementation of a universal set of gates. This midterm challenge will soon be faced by various quantum technologies, which urges the need of realistic assessments of their prospects. In this work, we pursue this goal by assessing the capability of current trapped-ion architectures in facing one of the most demanding parts of this quest: the implementation of an entangling controlled-NOT (CNOT) gate between encoded logical qubits. We present a detailed comparative study of two alternative strategies for trapped-ion topological color codes, either a transversal or a lattice-surgery approach, characterized by a detailed microscopic modeling of both current technological capabilities and experimental sources of noise afflicting the different operations. Our careful fault-tolerant design, together with a low-resource optimization, allows us to determine via exhaustive numerical simulations the experimental regimes where each of the approaches becomes favorable. We hope that our study thereby contributes to guiding the future development of trapped-ion quantum computers.