Search SciRate

Fault-tolerant fusion-based photonic quantum computing (FBQC) greatly relies on entangling two-photon measurements, called fusions. These fusions can be realized using linear-optical projective Bell-state measurements (BSMs). These linear-optical BSMs are limited to a success probability of 50%, greatly reducing the performance of FBQC schemes. To improve the performance of FBQC architectures, a boosted BSM scheme taking advantage of ancillary entangled photon pairs and a 4x4 multiport interferometer has been proposed. This scheme allows the success probability to be increased up to 75%. In this work, we experimentally demonstrate this boosted BSM by using two Sagnac photon-pair sources and a fibre-based 4x4 multiport beam splitter. A boosted BSM success probability of $(69.3\pm0.3)\%$ has been achieved, exceeding the 50% limit. Furthermore, based on our BSMs, we calculate photon-loss thresholds for a fusion network using encoded six-ring resource states. We show that with this boosted BSM scheme an individual photon loss probability of 1.4% can be tolerated, while the non-boosted BSM leads to a photon-loss threshold of 0.45%.

We propose a teleportation-based scheme to implement a universal set of quantum gates with a four-component cat code, assisted by appropriate entangled resource states and photon number resolving detection. The four-component cat code features the ability to recover from single photon loss. Here, we propose a concrete procedure to correct the single photon loss, including detecting the single photon loss event and recovering the initial states. By concatenating with standard qubit error correcting codes, we estimate the loss threshold for fault-tolerant quantum computation and obtain a significant improvement over the two-component cat code.

We introduce a new open-source software library Jet, which uses task-based parallelism to obtain speed-ups in classical tensor-network simulations of quantum circuits. These speed-ups result from i) the increased parallelism introduced by mapping the tensor-network simulation to a task-based framework, ii) a novel method of reusing shared work between tensor-network contraction tasks, and iii) the concurrent contraction of tensor networks on all available hardware. We demonstrate the advantages of our method by benchmarking our code on several Sycamore-53 and Gaussian boson sampling (GBS) supremacy circuits against other simulators. We also provide and compare theoretical performance estimates for tensor-network simulations of Sycamore-53 and GBS supremacy circuits for the first time.

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.

Bosonic qubits are a promising route to building fault-tolerant quantum computers on a variety of physical platforms. Studying the performance of bosonic qubits under realistic gates and measurements is challenging with existing analytical and numerical tools. We present a novel formalism for simulating classes of states that can be represented as linear combinations of Gaussian functions in phase space. This formalism allows us to analyze and simulate a wide class of non-Gaussian states, transformations and measurements. We demonstrate how useful classes of bosonic qubits -- Gottesman-Kitaev-Preskill (GKP), cat, and Fock states -- can be simulated using this formalism, opening the door to investigating the behaviour of bosonic qubits under Gaussian channels and measurements, non-Gaussian transformations such as those achieved via gate teleportation, and important non-Gaussian measurements such as threshold and photon-number detection. Our formalism enables simulating these situations with levels of accuracy that are not feasible with existing methods. Finally, we use a method informed by our formalism to simulate circuits critical to the study of fault-tolerant quantum computing with bosonic qubits but beyond the reach of existing techniques. Specifically, we examine how finite-energy GKP states transform under realistic qubit phase gates; interface with a CV cluster state; and transform under non-Clifford T gate teleportation using magic states. We implement our simulation method as a part of the open-source Strawberry Fields Python library.

Growing interest in quantum computing for practical applications has led to a surge in the availability of programmable machines for executing quantum algorithms. Present day photonic quantum computers have been limited either to non-deterministic operation, low photon numbers and rates, or fixed random gate sequences. Here we introduce a full-stack hardware-software system for executing many-photon quantum circuits using integrated nanophotonics: a programmable chip, operating at room temperature and interfaced with a fully automated control system. It enables remote users to execute quantum algorithms requiring up to eight modes of strongly squeezed vacuum initialized as two-mode squeezed states in single temporal modes, a fully general and programmable four-mode interferometer, and genuine photon number-resolving readout on all outputs. Multi-photon detection events with photon numbers and rates exceeding any previous quantum optical demonstration on a programmable device are made possible by strong squeezing and high sampling rates. We verify the non-classicality of the device output, and use the platform to carry out proof-of-principle demonstrations of three quantum algorithms: Gaussian boson sampling, molecular vibronic spectra, and graph similarity.

Photonics is a promising platform for demonstrating a quantum computational advantage (QCA) by outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing proposals and demonstrations face challenges. Experimentally, current implementations of Gaussian boson sampling (GBS) lack programmability or have prohibitive loss rates. Theoretically, there is a comparative lack of rigorous evidence for the classical hardness of GBS. In this work, we make progress in improving both the theoretical evidence and experimental prospects. We provide evidence for the hardness of GBS, comparable to the strongest theoretical proposals for QCA. We also propose a new QCA architecture we call high-dimensional GBS, which is programmable and can be implemented with low loss using few optical components. We show that particular algorithms for simulating GBS are outperformed by high-dimensional GBS experiments at modest system sizes. This work thus opens the path to demonstrating QCA with programmable photonic processors.

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.

Photon loss is destructive to the performance of quantum photonic devices and therefore suppressing the effects of photon loss is paramount to photonic quantum technologies. We present two schemes to mitigate the effects of photon loss for a Gaussian Boson Sampling device, in particular, to improve the estimation of the sampling probabilities. Instead of using error correction codes which are expensive in terms of their hardware resource overhead, our schemes require only a small amount of hardware modifications or even no modification. Our loss-suppression techniques rely either on collecting additional measurement data or on classical post-processing once the measurement data is obtained. We show that with a moderate cost of classical post processing, the effects of photon loss can be significantly suppressed for a certain amount of loss. The proposed schemes are thus a key enabler for applications of near-term photonic quantum devices.

We develop a unified theoretical framework for the efficient description of multiphoton states generated and propagating in loop-based optical networks which contain nonlinear elements. These active optical components are modeled as nonlinear media, resembling a two-mode squeezer. First, such nonlinear components can be seeded to manipulate quantum states of light, as such enabling photon addition protocols. And, second, they can function as an amplifying medium for quantum light. To prove the practical importance of our approach, the impact of multiple round trips is analyzed for states propagating in experimentally relevant loop configurations of networks, such as time-multiplexed driven quantum walks and iterative photon-number state generation protocols. Our method not only enables us to model such complex systems but also allows us to propose alternative setups that overcome previous limitations. To characterize the systems under study, we provide exact expressions for fidelities with target states, success probabilities of heralding-type measurements, and correlations between optical modes, including many realistic imperfections. Moreover, we provide an easily implementable numerical approach by devising a vector-type representation of photonic states, measurement operators, and passive and active processes.

We present modular and optimal architectures for implementing arbitrary discrete unitary transformations on light. These architectures are based on systematically combining smaller M-mode linear optical interferometers together to implement a larger N-mode transformation. Thus this work enables the implementation of large linear optical transformations using smaller modules that act on the spatial or the internal degrees of freedom of light such as polarization, time or orbital angular momentum. The architectures lead to a rectangular gate structure, which is optimal in the sense that realizing arbitrary transformations on these architectures needs a minimal number of optical elements and minimal circuit depth. Moreover, the rectangular structure ensures that each the different optical modes incur balanced optical losses, so the architectures promise substantially enhanced process fidelities as compared to existing schemes.

A crucial challenge to the scaling up of linear optical interferometers is the presence of defective optical components resulting from inevitable imperfections in fabrication and packaging. This work presents a method for circumventing such defective components including lossy modes and unresponsive phase shifters and beam-splitters. The method allows for using universal linear optical interferometers with such defects as smaller universal interferometers. The method presented here tolerates remarkably high defect rates in constructing linear optical interferometers, thus bringing closer to reality the possibility of obtaining quantum advantage with linear optics.

We present and analyze the fermionic time evolving density matrix using orthogonal polynomials algorithm (fTEDOPA), which enables the numerically exact simulation of open quantum systems coupled to a fermionic environment. The method allows for simulating the time evolution of open quantum systems with arbitrary spectral densities at zero or finite temperatures with controllable and certified error. We demonstrate the efficacy of the method towards the simulation of quintessential fermionic open quantum systems including the resonant level model and quantum dot coupled to an impurity and towards simulating hitherto intractable problems in quantum transport. Furthermore, we demonstrate significant efficiency gains in the computational costs by performing simulations in the Heisenberg picture. Finally, we compare different approaches for simulating finite-temperature situations and provide guidelines for choosing between these approaches.

Multi-photon entangled states of light are key to advancing quantum communication, computation, and metrology. Current methods for building such states are based on stitching together photons from probabilistic sources. The probability of $N$ such sources firing simultaneously decreases exponentially with $N$, imposing severe limitations on the practically achievable number of coincident photons. We tackle this challenge with a quantum interference buffer (QIB), which combines three functionalities: firstly, it stores polarization qubits, enabling the use of polarization-entangled states as resource; secondly, it implements entangled-source multiplexing, greatly enhancing the resource-state generation rates; thirdly, it implements time-multiplexed, on-demand linear optical networks for interfering subsequent states. Using the QIB, we multiplex 21 Bell-state sources and demonstrate a nine-fold enhancement in the generation rate of four-photon GHZ states. The enhancement scales exponentially with the photon number; larger states benefit more strongly. Multiplexed photon entanglement and interference will find diverse applications in quantum photonics, allowing for practical realisations of multi-photon protocols.

Quantum physics, which describes the strange behavior of light and matter at the smallest scales, is one of the most successful descriptions of reality, yet it is notoriously inaccessible. Here we provide an approachable explanation of quantum physics using simple thought experiments. We derive all relevant quantum predictions using minimal mathematics, without introducing the advanced calculations that are typically used to describe quantum physics. We focus on the two key surprises of quantum physics, namely wave-particle duality, a term that was introduced to capture the fact that single quantum particles in some respects behave like waves and in other respects like particles, and entanglement, which applies to two or more quantum particles and brings out the inherent contradiction between quantum physics and seemingly obvious assumptions regarding the nature of reality. Following arguments originally made by John Bell and Lucien Hardy, we show that the so-called local hidden variables are inadequate at explaining the behavior of entangled quantum particles. This means that one either has to give up on hidden variables, i.e., the idea that the outcomes of measurements on quantum particles are determined before an experiment is actually carried out, or one has to relinquish the principle of locality, which requires that no causal influences should be faster than the speed of light and is a cornerstone of Einstein's theory of relativity. Finally, we describe how these remarkable predictions of quantum physics have been confirmed in experiments. We have successfully used the present approach in a course that is open to all undergraduate students at the University of Calgary, without any prerequisites in mathematics or physics.

We devise an all-optical scheme for the generation of entangled multimode photonic states encoded in temporal modes of light. The scheme employs a nonlinear down-conversion process in an optical loop to generate one- and higher-dimensional tensor network states of light. We illustrate the principle with the generation of two different classes of entangled tensor network states and report on a variational algorithm to simulate the ground-state physics of many-body systems. We demonstrate that state-of-the-art optical devices are capable of determining the ground-state properties of the spin-1/2 Heisenberg model. Finally, implementations of the scheme are demonstrated to be robust against realistic losses and mode mismatch.

Quantum state tomography (QST) is the gold standard technique for obtaining an estimate for the state of small quantum systems in the laboratory. Its application to systems with more than a few constituents (e.g. particles) soon becomes impractical as the effort required grows exponentially in the number of constituents. Developing more efficient techniques is particularly pressing as precisely-controllable quantum systems that are well beyond the reach of QST are emerging in laboratories. Motivated by this, there is a considerable ongoing effort to develop new characterisation tools for quantum many-body systems. Here we demonstrate Matrix Product State (MPS) tomography, which is theoretically proven to allow the states of a broad class of quantum systems to be accurately estimated with an effort that increases efficiently with constituent number. We first prove that this broad class includes the out-of-equilbrium states produced by 1D systems with finite-range interactions, up to any fixed point in time. We then use the technique to reconstruct the dynamical state of a trapped-ion quantum simulator comprising up to 14 entangled spins (qubits): a size far beyond the reach of QST. Our results reveal the dynamical growth of entanglement and description complexity as correlations spread out during a quench: a necessary condition for future beyond-classical performance. MPS tomography should find widespread use to study large quantum many-body systems and to benchmark and verify quantum simulators and computers.

This thesis reports advances in the theory of design, characterization and simulation of multi-photon multi-channel interferometers. I advance the design of interferometers through an algorithm to realize an arbitrary discrete unitary transformation on the combined spatial and internal degrees of freedom of light. This procedure effects an arbitrary $n_{s}n_{p}\times n_{s}n_{p}$ unitary matrix on the state of light in $n_{s}$ spatial and $n_{p}$ internal modes. I devise an accurate and precise procedure for characterizing any multi-port linear optical interferometer using one- and two-photon interference. Accuracy is achieved by estimating and correcting systematic errors that arise due to spatiotemporal and polarization mode mismatch. Enhanced accuracy and precision are attained by fitting experimental coincidence data to a curve simulated using measured source spectra. The efficacy of our characterization procedure is verified by numerical simulations. I develop group-theoretic methods for the analysis and simulation of linear interferometers. I devise a graph-theoretic algorithm to construct the boson realizations of the canonical SU$(n)$ basis states, which reduce the canonical subgroup chain, for arbitrary $n$. The boson realizations are employed to construct $\mathcal{D}$-functions, which are the matrix elements of arbitrary irreducible representations, of SU$(n)$ in the canonical basis. I show that immanants of principal submatrices of a unitary matrix $T$ are a sum of the diagonal $\mathcal{D}(\Omega)$-functions of group element $\Omega$ over $t$ determined by the choice of submatrix and over the irrep $(\lambda)$ determined by the immanant under consideration. The algorithm for $\mathrm{SU}(n)$ $\mathcal{D}$-function computation and the results connecting these functions with immanants open the possibility of group-theoretic analysis and simulation of linear optics.

Motivated by recent results in multiphoton interferometry, we expand a result of Kostant on immanants of an arbitrary $m\times m$ unitary matrix $T\in$ su$(m)$ to the submatrices of $T$. Specifically, we show that immanants of principal submatrices of a unitary matrix $T$ are a sum $\sum_{t} D^{(\lambda)}_{tt}(\Omega)$ of the diagonal $D$-functions of group element $\Omega$, with $t$ determined by the choice of submatrix, and the irrep $(\lambda)$ determined by the immanant under consideration. We also provide evidence that this result extends to some submatrices that are not principal diagonal, and we discuss how this result can be extended to cases where $T$ carries an su$(m)$ representation that is different from the defining representation.

Any lossless transformation on $n_{s}$ spatial and $n_{p}$ internal modes of light can be described by an $n_{s}n_{p}\times n_{s}n_{p}$ unitary matrix, but there is no known procedure to effect an arbitrary $n_{s}n_{p}\times n_{s}n_{p}$ unitary matrix on light in $n_{s}$ spatial and $n_{p}$ internal modes. We devise an algorithm to realize an arbitrary discrete unitary transformation on the combined spatial and internal degrees of freedom of light. Our realization uses beamsplitters and operations on internal modes to effect arbitrary linear transformations. The number of beamsplitters required to realize a unitary transformation is reduced as compared to existing realization by a factor $n_{p}^2/2$ at the cost of increasing the number of internal optical elements by a factor of two. Our algorithm thus enables the optical implementation of higher dimensional unitary transformations.

We combine single- and two-photon interference procedures for characterizing any multi-port linear optical interferometer accurately and precisely. Accuracy is achieved by estimating and correcting systematic errors that arise due to spatiotemporal and polarization mode mismatch. Enhanced accuracy and precision are attained by fitting experimental coincidence data to curve simulated using measured source spectra. We employ bootstrapping statistics to quantify the resultant degree of precision. A scattershot approach is devised to effect a reduction in the experimental time required to characterize the interferometer. The efficacy of our characterization procedure is verified by numerical simulations.

Boson realizations map operators and states of groups to transformations and states of bosonic systems. We devise a graph-theoretic algorithm to construct the boson realizations of the canonical SU$(n)$ basis states, which reduce the canonical subgroup chain, for arbitrary $n$. The boson realizations are employed to construct $\mathcal{D}$-functions, which are the matrix elements of arbitrary irreducible representations, of SU$(n)$ in the canonical basis. We demonstrate that our $\mathcal{D}$-function algorithm offers significant advantage over the two competing procedures, namely factorization and exponentiation.