SearcharxivSearch

arXiv subjects

Daniel J. Brod

Publications and source records attributed to Daniel J. Brod.

At least 19 recordsLinked to original sources

Experimental observation of counter-intuitive features of photonic bunching

Bosonic bunching is a term used to describe the well-known tendency of bosons to bunch together, and which differentiates their behaviour from that of fermions or classical particles. However, in some situations perfectly indistinguishable bosons may counter-intuitively bunch less than classical, distinguishable particles. Here we report two such counter-intuitive multiphoton bunching effects observed with three photons in a three-mode balanced photonic Fourier interferometer. In this setting, we show indistinguishable photons actually minimize the probability of bunching. We also show that any non-trivial value of the three-photon collective photonic phase leads to a decreased probability of all photons ending up in the same mode, even as we increase pairwise indistinguishability. Our experiments feature engineering of partial indistinguishability scenarios using both the time and the polarization photonic degrees of freedom, and a polarization-transparent 8-mode tunable interferometer with a quantum-dot source of single photons. Besides the foundational understanding, the observation of these counter-intuitive phenomena open news perspective in devising more efficient ways of routing photons for advantage in metrology and quantum computation.

quant-ph

The Complexity of Bipartite Gaussian Boson Sampling

Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant interest, from the perspective of computational complexity theory, in solidifying the mathematical foundation for the hardness of simulating these devices. We show that, under the standard Anti-Concentration and Permanent-of-Gaussians conjectures, there is no efficient classical algorithm to sample from ideal Gaussian boson sampling distributions (even approximately) unless the polynomial hierarchy collapses. The hardness proof holds in the regime where the number of modes scales quadratically with the number of photons, a setting in which hardness was widely believed to hold but that nevertheless had no definitive proof. Crucial to the proof is a new method for programming a Gaussian boson sampling device so that the output probabilities are proportional to the permanents of submatrices of an arbitrary matrix. This technique is a generalization of Scattershot BosonSampling that we call BipartiteGBS. We also make progress towards the goal of proving hardness in the regime where there are fewer than quadratically more modes than photons (i.e., the high-collision regime) by showing that the ability to approximate permanents of matrices with repeated rows/columns confers the ability to approximate permanents of matrices with no repetitions. The reduction suffices to prove that GBS is hard in the constant-collision regime.

quant-ph

Quantifying Quantum Causal Influences

Causal influences are at the core of any empirical science, the reason why its quantification is of paramount relevance for the mathematical theory of causality and applications. Quantum correlations, however, challenge our notion of cause and effect, implying that tools and concepts developed over the years having in mind a classical world, have to be reevaluated in the presence of quantum effects. Here, we propose the quantum version of the most common causality quantifier, the average causal effect (ACE), measuring how much a target quantum system is changed by interventions on its presumed cause. Not only it offers an innate manner to quantify causation in two-qubit gates but also in alternative quantum computation models such as the measurement-based version, suggesting that causality can be used as a proxy for optimizing quantum algorithms. Considering quantum teleportation, we show that any pure entangled state offers an advantage in terms of causal effects as compared to separable states. This broadness of different uses showcases that, just as in the classical case, the quantification of causal influence has foundational and applied consequences and can lead to a yet totally unexplored tool for quantum information science.

quant-ph

Non-linear Boson Sampling

Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon-photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.

quant-ph

Measuring relational information between quantum states, and applications

The geometrical arrangement of a set of quantum states can be completely characterized using relational information only. This information is encoded in the pairwise state overlaps, as well as in Bargmann invariants of higher degree written as traces of products of density matrices. We describe how to measure Bargmann invariants using suitable generalizations of the SWAP test. This allows for a complete and robust characterization of the projective-unitary invariant properties of any set of pure or mixed states. As applications, we describe basis-independent tests for linear independence, coherence, and imaginarity. We also show that Bargmann invariants can be used to characterize multi-photon indistinguishability.

quant-ph

Witnesses of coherence and dimension from multiphoton indistinguishability tests

Quantum coherence marks a deviation from classical physics, and has been studied as a resource for metrology and quantum computation. Finding reliable and effective methods for assessing its presence is then highly desirable. Coherence witnesses rely on measuring observables whose outcomes can guarantee that a state is not diagonal in a known reference basis. Here we experimentally measure a novel type of coherence witness that uses pairwise state comparisons to identify superpositions in a basis-independent way. Our experiment uses a single interferometric set-up to simultaneously measure the three pairwise overlaps among three single-photon states via Hong-Ou-Mandel tests. Besides coherence witnesses, we show the measurements also serve as a Hilbert-space dimension witness. Our results attest to the effectiveness of pooling many two-state comparison tests to ascertain various relational properties of a set of quantum states.

quant-ph

Linear-optical dynamics of one-dimensional anyons

We study the dynamics of bosonic and fermionic anyons defined on a one-dimensional lattice, under the effect of Hamiltonians quadratic in creation and annihilation operators, commonly referred to as linear optics. These anyonic models are obtained from deformations of the standard bosonic or fermionic commutation relations via the introduction of a non-trivial exchange phase between different lattice sites. We study the effects of the anyonic exchange phase on the usual bosonic and fermionic bunching behaviors. We show how to exploit the inherent Aharonov-Bohm effect exhibited by these particles to build a deterministic, entangling two-qubit gate and prove quantum computational universality in these systems. We define coherent states for bosonic anyons and study their behavior under two-mode linear-optical devices. In particular we prove that, for a specific value of the exchange factor, an anyonic mirror can generate cat states, an important resource in quantum information processing with continuous variables.

quant-ph

Quantum computation from fermionic anyons on a 1D lattice

Fermionic linear optics corresponds to the dynamics of free fermions, and is known to be efficiently simulable classically. We define fermionic anyon models by deforming the fermionic algebra of creation and annihilation operators, and consider the dynamics of number-preserving, quadratic Hamiltonians on these operators. We show that any such deformation results in an anyonic linear optical model which allows for universal quantum computation.

quant-ph

Quantum and classical bounds for two-state overlaps

Suppose we have $N$ quantum systems in unknown states $\lvertψ_i \rangle $, but know the value of some pairwise overlaps $\left| \langle ψ_k \lvert ψ_l \rangle \right|^2$. What can we say about the values of the unknown overlaps? We provide a complete answer to this problem for three pure states and two given overlaps, and a way to obtain bounds for the general case. We discuss how the answer contrasts from that of a classical model featuring only coherence-free, diagonal states, and describe three applications: basis-independent coherence witnesses, dimension witnesses, and characterisation of multi-photon indistinguishability.

quant-ph

Regimes of classical simulability for noisy Gaussian boson sampling

As a promising candidate for exhibiting quantum computational supremacy, Gaussian Boson Sampling (GBS) is designed to exploit the ease of experimental preparation of Gaussian states. However, sufficiently large and inevitable experimental noise might render GBS classically simulable. In this work, we formalize this intuition by establishing a sufficient condition for approximate polynomial-time classical simulation of noisy GBS --- in the form of an inequality between the input squeezing parameter, the overall transmission rate and the quality of photon detectors. Our result serves as a non-classicality test that must be passed by any quantum computationalsupremacy demonstration based on GBS. We show that, for most linear-optical architectures, where photon loss increases exponentially with the circuit depth, noisy GBS loses its quantum advantage in the asymptotic limit. Our results thus delineate intermediate-sized regimes where GBS devices might considerably outperform classical computers for modest noise levels. Finally, we find that increasing the amount of input squeezing is helpful to evade our classical simulation algorithm, which suggests a potential route to mitigate photon loss.

quant-ph

Experimental quantification of genuine four-photon indistinguishability

Photon indistinguishability plays a fundamental role in information processing, with applications such as linear-optical quantum computation and metrology. It is then necessary to develop appropriate tools to quantify the amount of this resource in a multiparticle scenario. Here we report a four-photon experiment in a linear-optical interferometer designed to simultaneously estimate the degree of indistinguishability between three pairs of photons. The interferometer design dispenses with the need of heralding for parametric down-conversion sources, resulting in an efficient and reliable optical scheme. We then use a recently proposed theoretical framework to quantify genuine four-photon indistinguishability, as well as to obtain bounds on three unmeasured two-photon overlaps. Our findings are in high agreement with the theory, and represent a new resource-effective technique for the characterization of multiphoton interference.

quant-ph

Two-photon self-Kerr nonlinearities for quantum computing and quantum optics

The self-Kerr interaction is an optical nonlinearity that produces a phase shift proportional to the square of the number of photons in the field. At present, many proposals use nonlinearities to generate photon-photon interactions. For propagating fields these interactions result in undesirable features such as spectral correlation between the photons. Here, we engineer a discrete network composed of cross-Kerr interaction regions to simulate a self-Kerr medium. The medium has effective long-range interactions implemented in a physically local way. We compute the one- and two-photon S matrices for fields propagating in this medium. From these scattering matrices we show that our proposal leads to a high fidelity photon-photon gate. In the limit where the number of nodes in the network tends to infinity, the medium approximates a perfect self-Kerr interaction in the one- and two-photon regime.

quant-ph

Witnessing genuine multi-photon indistinguishability

Bosonic interference is a fundamental physical phenomenon, and it is believed to lie at the heart of quantum computational advantage. It is thus necessary to develop practical tools to witness its presence, both for a reliable assessment of a quantum source and for fundamental investigations. Here we describe how linear interferometers can be used to unambiguously witness genuine n-boson indistinguishability. The amount of violation of the proposed witnesses bounds the degree of multi-boson indistinguishability, for which we also provide a novel intuitive model using set theory. We experimentally implement this test to bound the degree of 3-photon indistinguishability in states we prepare using parametric down-conversion. Our approach results in a convenient tool for practical photonic applications, and may inspire further fundamental advances based on the operational framework we adopt.

quant-ph

Classical simulation of photonic linear optics with lost particles

We explore the possibility of efficient classical simulation of linear optics experiments under the effect of particle losses. Specifically, we investigate the canonical boson sampling scenario in which an $n$-particle Fock input state propagates through a linear-optical network and is subsequently measured by particle-number detectors in the $m$ output modes. We examine two models of losses. In the first model a fixed number of particles is lost. We prove that in this scenario the output statistics can be well approximated by an efficient classical simulation, provided that the number of photons that is left grows slower than $\sqrt{n}$. In the second loss model, every time a photon passes through a beamsplitter in the network, it has some probability of being lost. For this model the relevant parameter is $s$, the smallest number of beamsplitters that any photon traverses as it propagates through the network. We prove that it is possible to approximately simulate the output statistics already if $s$ grows logarithmically with $m$, regardless of the geometry of the network. The latter result is obtained by proving that it is always possible to commute $s$ layers of uniform losses to the input of the network regardless of its geometry, which could be a result of independent interest. We believe that our findings put strong limitations on future experimental realizations of quantum computational supremacy proposals based on boson sampling.

quant-ph

Optimal photonic indistinguishability tests in multimode networks

Particle indistinguishability is at the heart of quantum statistics that regulates fundamental phenomena such as the electronic band structure of solids, Bose-Einstein condensation and superconductivity. Moreover, it is necessary in practical applications such as linear optical quantum computation and simulation, in particular for Boson Sampling devices. It is thus crucial to develop tools to certify genuine multiphoton interference between multiple sources. Here we show that so-called Sylvester interferometers are near-optimal for the task of discriminating the behaviors of distinguishable and indistinguishable photons. We report the first implementations of integrated Sylvester interferometers with 4 and 8 modes with an efficient, scalable and reliable 3D-architecture. We perform two-photon interference experiments capable of identifying indistinguishable photon behaviour with a Bayesian approach using very small data sets. Furthermore, we employ experimentally this new device for the assessment of scattershot Boson Sampling. These results open the way to the application of Sylvester interferometers for the optimal assessment of multiphoton interference experiments.

quant-ph

Experimental generalized quantum suppression law in Sylvester interferometers

Photonic interference is a key quantum resource for optical quantum computation, and in particular for so-called boson sampling machines. In interferometers with certain symmetries, genuine multiphoton quantum interference effectively suppresses certain sets of events, as in the original Hong-Ou-Mandel effect. Recently, it was shown that some classical and semi-classical models could be ruled out by identifying such suppressions in Fourier interferometers. Here we propose a suppression law suitable for random-input experiments in multimode Sylvester interferometers, and verify it experimentally using 4- and 8-mode integrated interferometers. The observed suppression is stronger than what is observed in Fourier interferometers of the same size, and could be relevant to certification of boson sampling machines and other experiments relying on bosonic interference.

quant-ph

Two photons co- and counter-propagating through $N$ cross-Kerr sites

A cross-Kerr interaction produces a phase shift on two modes of light proportional to the number of photons in both modes, and is sometimes called cross-phase modulation. Cross-Kerr nonlinearities have many applications in classical and quantum nonlinear optics, including the possibility of a deterministic and all-optical controlled-phase gate. We calculate the one- and two-photon S-matrix for fields propagating in a medium where the cross-Kerr interaction is spatially distributed at discrete interaction sites comprised of atoms. For the interactions considered, we analyze the cases where the photons co-propagate and counter-propagate through the medium and give a physical interpretation to the differences between the two cases. Finally, we obtain the S-matrix in the limit of infinitely long chains, showing that it corresponds to a perfect controlled-phase operation.

quant-ph

A passive CPHASE gate via cross-Kerr nonlinearities

A fundamental and open question is whether cross-Kerr nonlinearities can be used to construct a controlled-phase (CPHASE) gate. Here we propose a gate constructed from a discrete set of atom-mediated cross-Kerr interaction sites with counter-propagating photons. We show that the average gate fidelity $F$ between a CPHASE and our proposed gate increases as the number of interaction sites increases and the spectral width of the photon decreases, e.g. with 12 sites we find $F > 99\%$.

quant-ph