arXiv subjects

Haoyu Qi

Publications and source records attributed to Haoyu Qi.

At least 19 recordsLinked to original sources

arXiv2024

Phase engineering of giant second harmonic generation in Bi$_2$O$_2$Se

Two-dimensional (2D) materials with remarkable second-harmonic generation (SHG) hold promise for future on-chip nonlinear optics. Relevant materials with both giant SHG response and environmental stability are long-sought targets. Here, we demonstrate the enormous SHG from the phase engineering of a high-performance semiconductor, Bi$_2$O$_2$Se (BOS), under uniaxial strain. SHG signals captured in strained 20 nm-BOS films exceed those of NbOI$_2$ and NbOCl$_2$ of similar thickness by a factor of 10, and are four orders of magnitude higher than monolayer-MoS$_2$, resulting in a significant second-order nonlinear susceptibility on the order of 1 nm V$^{-1}$. Intriguingly, the strain enables continuous adjustment of the ferroelectric phase transition across room temperature. Consequently, an exceptionally large tunability of SHG, approximately six orders of magnitude, is achieved through strain or thermal modulation. This colossal SHG, originating from the geometric phase of Bloch wave functions and coupled with sensitive tunability through multiple approaches in this air-stable 2D semiconductor, opens new possibilities for designing chip-scale, switchable nonlinear optical devices.

cond-mat.mtrl-sci↗

arXiv2022

Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction

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.

quant-ph↗

arXiv2022

Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling

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.

quant-ph↗

arXiv2021

Quadratic speedup for simulating Gaussian boson sampling

We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods. The complexity of the algorithm is exponential in the number of photon pairs detected, not the number of photons, and is directly proportional to the time required to calculate a probability amplitude for a pure Gaussian state. The main innovation is to use auxiliary conditioning variables to reduce the problem of sampling to computing pure-state probability amplitudes, for which the most computationally-expensive step is calculating a loop hafnian. We implement and benchmark an improved loop hafnian algorithm and show that it can be used to compute pure-state probabilities, the dominant step in the sampling algorithm, of up to 50-photon events in a single workstation, i.e., without the need of a supercomputer.

quant-ph↗

arXiv2021

Error mitigation on a near-term quantum photonic device

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.

quant-ph↗

arXiv2021

Mitigating linear optics imperfections via port allocation and compilation

Linear optics is a promising route to building quantum technologies that operate at room temperature and can be manufactured scalably on integrated photonic platforms. However, scaling up linear optics requires high-performance operation amid inevitable manufacturing imperfections. We present techniques for enhancing the performance of linear optical interferometers by tailoring their port allocation and compilation to the on-chip imperfections, which can be determined beforehand by suitable calibration procedures that we introduce. As representative examples, we demonstrate dramatic reductions in the average power consumption of a given interferometer or in the range of its power consumption values across all possible unitary transformations implemented on it. Furthermore, we demonstrate the efficacy of these techniques at improving the fidelities of the desired transformations in the presence of fabrication defects. By improving the performance of linear optical interferometers in relevant metrics by several orders of magnitude, these tools bring optical technologies closer to demonstrating true quantum advantage.

quant-ph↗

arXiv2020

Efficient sampling from shallow Gaussian quantum-optical circuits with local interactions

We prove that a classical computer can efficiently sample from the photon-number probability distribution of a Gaussian state prepared by using an optical circuit that is shallow and local. Our work generalizes previous known results for qubits to the continuous-variable domain. The key to our proof is the observation that the adjacency matrices characterizing the Gaussian states generated by shallow and local circuits have small bandwidth. To exploit this structure, we devise fast algorithms to calculate loop hafnians of banded matrices. Since sampling from deep optical circuits with exponential-scaling photon loss is classically simulable, our results pose a challenge to the feasibility of demonstrating quantum supremacy on photonic platforms with local interactions.

quant-ph↗

arXiv2020

Quantum precision of beam pointing

We consider estimating a small transverse displacement of an optical beam over a line-of-sight propagation path: a problem that has numerous important applications ranging from establishing a lasercom link, single-molecule tracking, guided munition, to atomic force microscopy. We establish the ultimate quantum limit of the accuracy of sensing a beam displacement, and quantify the classical-quantum gap. Further, using normal-mode decomposition of the Fresnel propagation kernel, and insights from recent work on entanglement-assisted sensing, we find a near-term realizable multi-spatio-temporal-mode continuous-variable entangled-state probe and a receiver design, which attains the quantum precision limit. We find a Heisenberg-limited sensitivity enhancement in terms of the number of entangled temporal modes, and a curious super-Heisenberg quantum enhanced scaling in terms of the number of entangled spatial modes permitted by the diffraction-limited beam propagation geometry.

quant-ph↗

arXiv2020

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↗

arXiv2019

Production of photonic universal quantum gates enhanced by machine learning

We introduce photonic architectures for universal quantum computation. The first step is to produce a resource state which is a superposition of the first four Fock states with a probability $\geq 10^{-2}$, an increase by a factor of $10^4$ over standard sequential photon-subtraction techniques. The resource state is produced with near-perfect fidelity from a quantum gadget that uses displaced squeezed vacuum states, interferometers and photon-number resolving detectors. The parameters of this gadget are trained using machine learning algorithms for variational circuits. We discuss in detail various aspects of the non-Gaussian state preparation resulting from the numerical experiments. We then propose a notion of resource farms where these gadgets are stacked in parallel, to increase the success probability further. We find a trade-off between the success probability of the farm, the error tolerance, and the number of gadgets. Using the resource states in conventional gate teleportation techniques we can then implement weak tuneable cubic phase gates. The numerical tools that have been developed could potentially be useful for other applications in photonics as well.

quant-ph↗

arXiv2018

Linear multiport photonic interferometers: loss analysis of temporally-encoded architectures

Implementing spatially-encoded universal linear multiport interferometers on integrated photonic platforms with high controllability becomes increasingly difficult as the number of modes increases. In this work, we consider an architecture in which temporally-encoded modes are injected into a chain of reconfigurable beamsplitters and delay loops, and provide a detailed loss analysis for this and other comparable architectures. This analysis also yields a straightforward and explicit description of the control sequence needed for implementing an arbitrary temporally-encoded transformation. We consider possible physical implementations of these architectures and compare their performance. We conclude that implementing a chain of reconfigurable beamsplitters and delay loops on an integrated lithum niobate platform could outperform comparable architectures in the near future.

quant-ph↗

arXiv2018

Energy-constrained private and quantum capacities of quantum channels

This paper establishes a general theory of energy-constrained quantum and private capacities of quantum channels. We begin by defining various energy-constrained communication tasks, including quantum communication with a uniform energy constraint, entanglement transmission with an average energy constraint, private communication with a uniform energy constraint, and secret key transmission with an average energy constraint. We develop several code conversions, which allow us to conclude non-trivial relations between the capacities corresponding to the above tasks. We then show how the regularized, energy-constrained coherent information is equal to the capacity for the first two tasks and is an achievable rate for the latter two tasks, whenever the energy observable satisfies the Gibbs condition of having a well defined thermal state for all temperatures and the channel satisfies a finite output-entropy condition. For degradable channels satisfying these conditions, we find that the single-letter energy-constrained coherent information is equal to all of the capacities. We finally apply our results to degradable quantum Gaussian channels and recover several results already established in the literature (in some cases, we prove new results in this domain). Contrary to what may appear from some statements made in the literature recently, proofs of these results do not require the solution of any kind of minimum output entropy conjecture or entropy photon-number inequality.

quant-ph↗

arXiv2018

Entanglement-assisted private communication over quantum broadcast channels

We consider entanglement-assisted (EA) private communication over a quantum broadcast channel, in which there is a single sender and multiple receivers. We divide the receivers into two sets: the decoding set and the malicious set. The decoding set and the malicious set can either be disjoint or can have a finite intersection. For simplicity, we say that a single party Bob has access to the decoding set and another party Eve has access to the malicious set, and both Eve and Bob have access to the pre-shared entanglement with Alice. The goal of the task is for Alice to communicate classical information reliably to Bob and securely against Eve, and Bob can take advantage of pre-shared entanglement with Alice. In this framework, we establish a lower bound on the one-shot EA private capacity. When there exists a quantum channel mapping the state of the decoding set to the state of the malicious set, such a broadcast channel is said to be degraded. We establish an upper bound on the one-shot EA private capacity in terms of smoothed min- and max-entropies for such channels. In the limit of a large number of independent channel uses, we prove that the EA private capacity of a degraded quantum broadcast channel is given by a single-letter formula. Finally, we consider two specific examples of degraded broadcast channels and find their capacities. In the first example, we consider the scenario in which one part of Bob's laboratory is compromised by Eve. We show that the capacity for this protocol is given by the conditional quantum mutual information of a quantum broadcast channel, and so we thus provide an operational interpretation to the dynamic counterpart of the conditional quantum mutual information. In the second example, Eve and Bob have access to mutually exclusive sets of outputs of a broadcast channel.

quant-ph↗

arXiv2018

Implementing quantum algorithms on temporal photonic cluster states

Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms by performing homodyne measurements on a two-dimensional temporal continuous-variable cluster state. We first review the generation of temporal cluster states and the implementation of gates using the measurement-based model. Alongside this we discuss methods to introduce non-Gaussianity into the cluster states. The first algorithm we consider is Gaussian Boson Sampling in which only Gaussian unitaries need to be implemented. Taking into account the fact that input states are also Gaussian, the errors due to the effect of finite squeezing can be corrected, provided a moderate amount of online squeezing is available. This helps to construct a large Gaussian Boson Sampling machine. The second algorithm is the continuous-variable Instantaneous Quantum Polynomial circuit in which one needs to implement non-Gaussian gates, such as the cubic phase gate. We discuss several methods of implementing the cubic phase gate and fit them into the temporal cluster state architecture. The third algorithm is the continuous-variable version of Grover's search algorithm, the main challenge of which is the implementation of the inversion operator. We propose a method to implement the inversion operator by injecting a resource state into a teleportation circuit. The resource state is simulated using the Strawberry Fields quantum software package.

quant-ph↗

arXiv2018

Applications of position-based coding to classical communication over quantum channels

Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Renyi-2 entropies and conditional quantum entropies.

quant-ph↗

arXiv2017

On the minimum output entropy of single-mode phase-insensitive Gaussian channels

Recently de Palma et al. [IEEE Trans. Inf. Theory 63, 728 (2017)] proved---using Lagrange multiplier techniques---that under a non-zero input entropy constraint, a thermal state input minimizes the output entropy of a pure-loss bosonic channel. In this note, we present our attempt to generalize this result to all single-mode gauge-covariant Gaussian channels by using similar techniques. Unlike the case of the pure-loss channel, we cannot prove that the thermal input state is the only local extremum of the optimization problem. %It is unclear to us why the same techniques do not lead to a proof for amplifier channels. However, we do prove that, if the conjecture holds for gauge-covariant Gaussian channels, it would also hold for gauge-contravariant Gaussian channels. The truth of the latter leads to a solution of the triple trade-off and broadcast capacities of quantum-limited amplifier channels. We note that de Palma et al. [Phys. Rev. Lett. 118, 160503 (2017)] have now proven the conjecture for all single-mode gauge-covariant Gaussian channels by employing a different approach from what we outline here. Proving a multi-mode generalization of de Palma et al.'s above mentioned result---i.e., given a lower bound on the von Neumann entropy of the input to an $n$-mode lossy thermal-noise bosonic channel, an $n$-mode product thermal state input minimizes the output entropy---will establish an important special case of the conjectured Entropy Photon-number Inequality (EPnI). The EPnI, if proven true, would take on a role analogous to Shannon's EPI in proving coding theorem converses involving quantum limits of classical communication over bosonic channels.

quant-ph↗

arXiv2017

Optimal digital dynamical decoupling for general decoherence via Walsh modulation

We provide a general framework for constructing digital dynamical decoupling sequences based on Walsh modulation --- applicable to arbitrary qubit decoherence scenarios. By establishing equivalence between decoupling design based on Walsh functions and on concatenated projections, we identify a family of {\em optimal Walsh sequences}, which can be exponentially more efficient, in terms of the required total pulse number, for fixed cancellation order, than known digital sequences based on concatenated design. Optimal sequences for a given cancellation order are highly non-unique --- their performance depending sensitively on the control path. We provide an analytic upper bound to the achievable decoupling error, and show how sequences within the optimal Walsh family can substantially outperform concatenated decoupling, while respecting realistic timing constraints. We validate these conclusions by numerically computing the average fidelity in a toy model capturing the essential feature of hyperfine-induced decoherence in a quantum dot.

quant-ph↗

arXiv2017

Capacities of Quantum Amplifier Channels

Quantum amplifier channels are at the core of several physical processes. Not only do they model the optical process of spontaneous parametric down-conversion, but the transformation corresponding to an amplifier channel also describes the physics of the dynamical Casimir effect in superconducting circuits, the Unruh effect, and Hawking radiation. Here we study the communication capabilities of quantum amplifier channels. Invoking a recently established minimum output-entropy theorem for single-mode phase-insensitive Gaussian channels, we determine capacities of quantum-limited amplifier channels in three different scenarios. First, we establish the capacities of quantum-limited amplifier channels for one of the most general communication tasks, characterized by the trade-off between classical communication, quantum communication, and entanglement generation or consumption. Second, we establish capacities of quantum-limited amplifier channels for the trade-off between public classical communication, private classical communication, and secret key generation. Third, we determine the capacity region for a broadcast channel induced by the quantum-limited amplifier channel, and we also show that a fully quantum strategy outperforms those achieved by classical coherent detection strategies. In all three scenarios, we find that the capacities significantly outperform communication rates achieved with a naive time-sharing strategy.

quant-ph↗