arXiv subjects

Nicolas C. Menicucci

Publications and source records attributed to Nicolas C. Menicucci.

At least 37 records · Page 2Linked to original sources

arXiv2022

Particle scattering in a sonic analogue of special relativity

We investigate a simple toy model of particle scattering in the flat spacetime limit of an analogue-gravity model. The analogue-gravity medium is treated as a scalar field of phonons that obeys the Klein-Gordon equation and thus admits a Lorentz symmetry with respect to $c_\mathrm{s}$, the speed of sound in the medium. The particle from which the phonons are scattered is external to the system and does not obey the sonic Lorentz symmetry that the phonon field obeys. In-universe observers who use the exchange of sound to operationally measure distance and duration find that the external particle appears to be a sonically Lorentz-violating particle. By performing a sonic analogue to Compton scattering, in-universe observers can determine if they are in motion with respect to their medium. If in-universe observers were then to correctly postulate the dispersion relation of the external particle, their velocity with respect to the medium could be found.

gr-qc↗

arXiv2022

Streamlined quantum computing with macronode cluster states

Continuous-variable cluster states allow for fault-tolerant measurement-based quantum computing when used in tandem with the Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode. For quad-rail-lattice macronode cluster states, whose construction is defined by a fixed, low-depth beam splitter network, we show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We give explicit recipes to realize the Clifford generating set, and we calculate the logical gate-error rates given finite squeezing in the cluster-state and GKP resources. We find that logical error rates of $10^{-2}$-$10^{-3}$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9-13.7 dB. The protocol presented eliminates noise present in prior schemes and puts the required squeezing for fault tolerance in the range of current state-of-the-art optical experiments. Finally, we show how to produce distillable GKP magic states directly within the cluster state.

quant-ph↗

arXiv2021

Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits

The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.

quant-ph↗

arXiv2021

Subsystem analysis of continuous-variable resource states

Continuous-variable (CV) cluster states are a universal resource for fault-tolerant quantum computation when supplemented with the Gottesman-Kitaev-Preskill (GKP) bosonic code. We generalize the recently introduced subsystem decomposition of a bosonic code [Phys. Rev. Lett. 125, 040501 (2020)], and we use it to analyze CV cluster-state quantum computing with GKP states. Specifically, we decompose squeezed vacuum states and approximate GKP states to reveal their encoded logical information, and we decompose several gates crucial to CV cluster-state quantum computing. Then, we use the subsystem decomposition to quantify damage to the logical information in approximate GKP states teleported through noisy CV cluster states. Each of these studies uses the subsystem decomposition to circumvent complications arising from the full CV nature of the mode in order to focus on the encoded qubit information.

quant-ph↗

arXiv2021

Hidden qubit cluster states

Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state with the power to execute universal, fault-tolerant quantum computing in a measurement-based fashion. As the resource states that comprise a hybrid cluster state are of a very different nature, a natural question arises: Why do GKP states interface so well with CVCSs? To answer this question, we apply the recently introduced subsystem decomposition of a bosonic mode, which divides a mode into logical and gauge-mode subsystems, to three types of cluster state: CVCSs, GKP cluster states, and hybrid CV-GKP cluster states. We find that each of these contains a "hidden" qubit cluster state across their logical subsystems, which lies at the heart of their utility for measurement-based quantum computing. To complement the analytical approach, we introduce a simple graphical description of these CV-mode cluster states that depicts precisely how the hidden qubit cluster states are entangled with the gauge modes, and we outline how these results would extend to the case of finitely squeezed states. This work provides important insight that is both conceptually satisfying and helps to address important practical issues like when a simpler resource (such as a Gaussian state) can stand in for a more complex one (like a GKP state), leading to more efficient use of the resources available for CV quantum computing.

quant-ph↗

arXiv2021

Fault-tolerant quantum computation with static linear optics

The scalability of photonic implementations of fault-tolerant quantum computing based on Gottesman-Kitaev-Preskill (GKP) qubits is injured by the requirements of inline squeezing and reconfigurability of the linear optical network. In this work we propose a topologically error-corrected architecture that does away with these elements at no cost - in fact, at an advantage - to state preparation overheads. Our computer consists of three modules: a 2D array of probabilistic sources of GKP states; a depth-four circuit of static beamsplitters, phase shifters, and single-time-step delay lines; and a 2D array of homodyne detectors. The symmetry of our proposed circuit allows us to combine the effects of finite squeezing and uniform photon loss within the noise model, resulting in more comprehensive threshold estimates. These jumps over both architectural and analytical hurdles considerably expedite the construction of a photonic quantum computer.

quant-ph↗

arXiv2021

Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer

Photonics is the platform of choice to build a modular, easy-to-network quantum computer operating at room temperature. However, no concrete architecture has been presented so far that exploits both the advantages of qubits encoded into states of light and the modern tools for their generation. Here we propose such a design for a scalable and fault-tolerant photonic quantum computer informed by the latest developments in theory and technology. Central to our architecture is the generation and manipulation of three-dimensional hybrid resource states comprising both bosonic qubits and squeezed vacuum states. The proposal enables exploiting state-of-the-art procedures for the non-deterministic generation of bosonic qubits combined with the strengths of continuous-variable quantum computation, namely the implementation of Clifford gates using easy-to-generate squeezed states. Moreover, the architecture is based on two-dimensional integrated photonic chips used to produce a qubit cluster state in one temporal and two spatial dimensions. By reducing the experimental challenges as compared to existing architectures and by enabling room-temperature quantum computation, our design opens the door to scalable fabrication and operation, which may allow photonics to leap-frog other platforms on the path to a quantum computer with millions of qubits.

quant-ph↗

arXiv2020

Bandlimited Entanglement Harvesting

There are many reasons to believe that there is a fundamental minimum length scale below which distances cannot be reliably resolved. One method of constructing a quantum field with a finite minimum length scale is to use bandlimited quantum field theory, where the spacetime is mathematically both continuous and discrete. This is a modification to the field, which has been shown to have many consequences at the level of the field. We consider an operational approach and use a pair of particle detectors (two-level qubits) as a local probe of the field, which are coupled to the vacuum of the bandlimited massless scalar field in a time dependent way through a switching function. We show that, mathematically, the bandlimit modifies the spatial profile of the detectors so that they are only quasi-local. We explore two different types of switching functions, Gaussian and Dirac delta. We find that with Gaussian switching, the bandlimit exponentially suppresses the de-excitation of the detectors when the energy gap between the two levels is larger than the bandlimit. If the detectors are prepared in ground state, in certain regions of the parameter space they are able to extract more entanglement from the field than if there was no bandlimit. When the detectors couple with Dirac-delta switching, we show that a particle detector is most sensitive to the bandlimit when it couples to a small but finite region of spacetime. We find that the effects of a bandlimit are detectable using local probes. This work is important because it illustrates the possible observable consequences of a fundamental bandlimit in a quantum field.

quant-ph↗

arXiv2020

Continuous-variable gate teleportation and bosonic-code error correction

We examine continuous-variable gate teleportation using entangled states made from pure product states sent through a beamsplitter. We show that such states are Choi states for a (typically) non-unitary gate, and we derive the associated Kraus operator for teleportation, which can be used to realize non-Gaussian, non-unitary quantum operations on an input state. With this result, we show how gate teleportation is used to perform error correction on bosonic qubits encoded using the Gottesman-Kitaev-Preskill code. This result is presented in the context of deterministically produced macronode cluster states, generated by constant-depth linear optical networks, supplemented with a probabilistic supply of GKP states. The upshot of our technique is that state injection for both gate teleportation and error correction can be achieved without active squeezing operations -- an experimental bottleneck for quantum optical implementations.

quant-ph↗

arXiv2020

Cubic phase gates are not suitable for non-Clifford operations on GKP states

With the Gottesman-Kitaev-Preskill (GKP) encoding, Clifford gates and error correction can be carried out using simple Gaussian operations. Still, non-Clifford gates, required for universality, require non-Gaussian elements. In their original proposal, GKP suggested a particularly simple method of using a single application of the cubic phase gate to perform the logical non-Clifford T-gate. Here we show that this cubic phase gate approach performs extraordinarily poorly, even for arbitrarily large amounts of squeezing in the GKP state. Thus, contrary to common belief, the cubic phase gate is not suitable for achieving universal fault-tolerant quantum computation with GKP states.

quant-ph↗

arXiv2020

Modular Bosonic Subsystem Codes

We introduce a framework to decompose a bosonic mode into two virtual subsystems-a logical qubit and a gauge mode. This framework allows the entire toolkit of qubit-based quantum information to be applied in the continuous-variable setting. We give a detailed example based on a modular decomposition of the position basis and apply it in two situations. First, we decompose Gottesman-Kitaev-Preskill grid states and find that the encoded logical state can be damaged due to entanglement with the gauge mode. Second, we identify and disentangle qubit cluster states hidden inside of Gaussian continuous-variable cluster states.

quant-ph↗

arXiv2020

One-hundred step measurement-based quantum computation multiplexed in the time domain with 25 MHz clock frequency

Among various approaches toward quantum computation, measurement-based quantum computation (MBQC) multiplexed in time domain is currently a promising method for addressing the need for scalability. MBQC requires two components: cluster states and programmable measurements. With time-domain multiplexing, the former has been realized on an ultra-large-scale. The latter, however, has remained unrealized, leaving the large-scale cluster states unused. In this work, we make such a measurement system and use it to demonstrate basic quantum operations multiplexed in the time domain with 25 MHz clock frequency. We verify transformations of the input states and their nonclassicalities for single-step quantum operations and also observe multi-step quantum operations up to one hundred steps.

quant-ph↗

arXiv2020

Entanglement harvesting with coherently delocalized matter

We study entanglement harvesting for matter systems such as atoms, ions or molecules, whose center of mass degrees of freedom are quantum delocalized and which couple to a relativistic quantum field. We employ a generalized Unruh-deWitt detector model for the light-matter interaction, and we investigate how the coherent spreading of the quantum center of mass wave function of two delocalized detector systems impacts their ability to become entangled with one another, via their respective interaction with a quantum field. For very massive detectors with initially highly localized centers of mass, we recover the results of entanglement harvesting for pointlike Unruh-deWitt detectors with classical center of mass degrees of freedom. We find that entanglement harvesting is Gaussian suppressed in the initial center of mass delocalization of the detectors. We further find that spatial smearing profiles, which are commonly employed to model the finite size of atoms due to their atomic orbitals, are not suited to model center of mass delocalization. Finally, for coherently delocalized detectors, we compare entanglement harvesting in the vacuum to entanglement harvesting in media. We find that entanglement harvesting is significantly suppressed in media in which the wave propagation speed is much smaller than the vacuum speed of light.

quant-ph↗

arXiv2020

Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes

Encoding a qubit in the continuous degrees of freedom of an oscillator is a promising path to error-corrected quantum computation. One advantageous way to achieve this is through Gottesman-Kitaev-Preskill (GKP) grid states, whose symmetries allow for the correction of any small continuous error on the oscillator. Unfortunately, ideal grid states have infinite energy, so it is important to find finite-energy approximations that are realistic, practical, and useful for applications. In the first half of this work we investigate the impact of imperfect GKP states on computational circuits independently of the physical architecture. To this end, we analyze the behaviour of the physical and logical content of normalizable GKP states through several figures of merit, employing a recently-developed modular subsystem decomposition. By tracking the errors that enter into the computational circuit due to imperfections in the GKP states, we are able to gauge the utility of these states for NISQ (Noisy Intermediate-Scale Quantum) devices. In the second half, we focus on a state preparation approach in the photonic domain wherein photon-number-resolving measurements on some modes of Gaussian states produce non-Gaussian states in others. We produce detailed numerical results for the preparation of GKP states alongside estimating the resource requirements in practical settings and probing the quality of the resulting states with the tools we develop. Our numerical experiments indicate that we can generate any state in the GKP Bloch sphere with nearly equal resources, which has implications for magic state preparation overheads.

quant-ph↗

arXiv2019

Time-Domain Multiplexed 2-Dimensional Cluster State: Universal Quantum Computing Platform

Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and fault-tolerance. Universality is the ability to execute arbitrary multi-input quantum algorithms. Scalability means that computational resources such as logical qubits can be increased without requiring exponential increase in physical resources. Lastly, fault-tolerance is the ability to perform quantum algorithms in presence of imperfections and noise. A promising approach to scalability was demonstrated with the generation of one-million-mode 1-dimensional cluster state, a resource for one-input computation in measurement-based quantum computation (MBQC). The demonstration was based on time-domain multiplexing (TDM) approach using continuous-variable (CV) optical flying qumodes (CV analogue of qubit). Demonstrating universality, however, has been a challenging task for any physical system and approach. Here, we present, for the first time among any physical system, experimental realization of a scalable resource state for universal MBQC: a 2-dimensional cluster state. We also prove the universality and give the methodology for utilizing this state in MBQC. Our state is based on TDM approach that allows unlimited resource generation regardless of the coherence time of the system. As a demonstration of our method, we generate and verify a 2-dimensional cluster state capable of about 5,000 operation steps on 5 inputs.

quant-ph↗

arXiv2019

Robust fault tolerance for continuous-variable cluster states with excess anti-squeezing

The immense scalability of continuous-variable cluster states motivates their study as a platform for quantum computing, with fault tolerance possible given sufficient squeezing and appropriately encoded qubits [Menicucci, PRL 112, 120504 (2014)]. Here, we expand the scope of that result by showing that additional anti-squeezing has no effect on the fault-tolerance threshold, removing the purity requirement for experimental continuous-variable cluster-state quantum computing. We emphasize that the appropriate experimental target for fault-tolerant applications is to directly measure 15-17 dB of squeezing in the cluster state rather than the more conservative upper bound of 20.5 dB.

quant-ph↗

arXiv2019

All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code

The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit within an oscillator is particularly appealing for fault-tolerant quantum computing with bosons because Gaussian operations on encoded Pauli eigenstates enable Clifford quantum computing with error correction. We show that applying GKP error correction to Gaussian input states, such as vacuum, produces distillable magic states, achieving universality without additional non-Gaussian elements. Fault tolerance is possible with sufficient squeezing and low enough external noise. Thus, Gaussian operations are sufficient for fault-tolerant, universal quantum computing given a supply of GKP-encoded Pauli eigenstates.

quant-ph↗

arXiv2018

Ultra-Large-Scale Continuous-Variable Cluster States Multiplexed in the Time Domain

Quantum computers promise ultrafast performance of certain tasks. Experimentally appealing, measurement-based quantum computation (MBQC) requires an entangled resource called a cluster state, with long computations requiring large cluster states. Previously, the largest cluster state consisted of 8 photonic qubits or light modes, while the largest multipartite entangled state of any sort involved 14 trapped ions. These implementations involve quantum entities separated in space, and in general, each experimental apparatus is used only once. Here, we circumvent this inherent inefficiency by multiplexing light modes in the time domain. We deterministically generate and fully characterise a continuous-variable cluster state containing more than 10,000 entangled modes. This is, by 3 orders of magnitude, the largest entangled state ever created to date. The entangled modes are individually addressable wavepackets of light in two beams. Furthermore, we present an efficient scheme for MBQC on this cluster state based on sequential applications of quantum teleportation.

quant-ph↗