More Like this

1. Entanglement-enhanced optomechanical sensor array with application to dark matter searches

   https://doi.org/10.1038/s42005-023-01357-z  

   Brady, Anthony J. ; Chen, Xin ; Xia, Yi ; Manley, Jack ; Dey Chowdhury, Mitul ; Xiao, Kewen ; Liu, Zhen ; Harnik, Roni ; Wilson, Dalziel J. ; Zhang, Zheshen ; et al ( September 2023 , Communications Physics)

   Squeezed light has long been used to enhance the precision of a single optomechanical sensor. An emerging set of proposals seeks to use arrays of optomechanical sensors to detect weak distributed forces, for applications ranging from gravity-based subterranean imaging to dark matter searches; however, a detailed investigation into the quantum-enhancement of this approach remains outstanding. Here, we propose an array of entanglement-enhanced optomechanical sensors to improve the broadband sensitivity of distributed force sensing. By coherently operating the optomechanical sensor array and distributing squeezing to entangle the optical fields, the array of sensors has a scaling advantage over independent sensors (i.e.,$$\sqrt{M}\to M$$$\sqrt{M}\to M$, whereMis the number of sensors) due to coherence as well as joint noise suppression due to multi-partite entanglement. As an illustration, we consider entanglement-enhancement of an optomechanical accelerometer array to search for dark matter, and elucidate the challenge of realizing a quantum advantage in this context.

    

   more » « less
2. Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity

   https://doi.org/10.1007/s00453-023-01102-6  

   Akmal, Shyan ; Chen, Lijie ; Jin, Ce ; Raj, Malvika ; Williams, Ryan ( February 2023 , Algorithmica)

   In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include:

   Certifying that a list ofnintegers has no 3-SUM solution can be done in Merlin–Arthur time$$\tilde{O}(n)$$$\tilde{O}\left(n\right)$. Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in$$\tilde{O}(n^{1.5})$$$\tilde{O}\left(n^{1.5}\right)$time (that is, there is a proof system with proofs of length$$\tilde{O}(n^{1.5})$$$\tilde{O}\left(n^{1.5}\right)$and a deterministic verifier running in$$\tilde{O}(n^{1.5})$$$\tilde{O}\left(n^{1.5}\right)$time).

   Counting the number ofk-cliques with total edge weight equal to zero in ann-node graph can be done in Merlin–Arthur time$${\tilde{O}}(n^{\lceil k/2\rceil })$$$\tilde{O}\left(n^{\lceil k/2\rceil }\right)$(where$$k\ge 3$$$k\ge 3$). For oddk, this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in anm-edge graph can be done in Merlin–Arthur time$${\tilde{O}}(m)$$$\tilde{O}\left(m\right)$. Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only countk-cliques in unweighted graphs, and had worse running times for smallk.

   Computing the All-Pairs Shortest Distances matrix for ann-node graph can be done in Merlin–Arthur time$$\tilde{O}(n^2)$$$\tilde{O}\left(n^2\right)$. Note this is optimal, as the matrix can have$$\Omega (n^2)$$$\Omega \left(n^2\right)$nonzero entries in general. Previously, Carmosino et al. [ITCS 2016] showed that this problem has an$$\tilde{O}(n^{2.94})$$$\tilde{O}\left(n^{2.94}\right)$nondeterministic time algorithm.

   Certifying that ann-variablek-CNF is unsatisfiable can be done in Merlin–Arthur time$$2^{n/2 - n/O(k)}$$$2^{n/2-n/O\left(k\right)}$. We also observe an algebrization barrier for the previous$$2^{n/2}\cdot \textrm{poly}(n)$$$2^{n/2}·\text{poly}\left(n\right)$-time Merlin–Arthur protocol of R. Williams [CCC’16] for$$\#$$$\#$SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol fork-UNSAT running in$$2^{n/2}/n^{\omega (1)}$$$2^{n/2}/n^{\omega \left(1\right)}$time. Therefore we have to exploit non-algebrizing properties to obtain our new protocol.

   Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time$$2^{4n/5}\cdot \textrm{poly}(n)$$$2^{4n/5}·\text{poly}\left(n\right)$. Previously, the only nontrivial result known along these lines was an Arthur–Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in$$2^{2n/3}\cdot \textrm{poly}(n)$$$2^{2n/3}·\text{poly}\left(n\right)$time.

   Due to the centrality of these problems in fine-grained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution tonintegers can be done in Merlin–Arthur time$$2^{n/3}\cdot \textrm{poly}(n)$$$2^{n/3}·\text{poly}\left(n\right)$, improving on the previous best protocol by Nederlof [IPL 2017] which took$$2^{0.49991n}\cdot \textrm{poly}(n)$$$2^{0.49991n}·\text{poly}\left(n\right)$time.

    

   more » « less
3. Random Quantum Circuits Transform Local Noise into Global White Noise

   https://doi.org/10.1007/s00220-024-04958-z  

   Dalzell, Alexander M. ; Hunter-Jones, Nicholas ; Brandão, Fernando G. S. L. ( March 2024 , Communications in Mathematical Physics)

   We study the distribution over measurement outcomes of noisy random quantum circuits in the regime of low fidelity, which corresponds to the setting where the computation experiences at least one gate-level error with probability close to one. We model noise by adding a pair of weak, unital, single-qubit noise channels after each two-qubit gate, and we show that for typical random circuit instances, correlations between the noisy output distribution$$p_{\text {noisy}}$$$p_{\text{noisy}}$and the corresponding noiseless output distribution$$p_{\text {ideal}}$$$p_{\text{ideal}}$shrink exponentially with the expected number of gate-level errors. Specifically, the linear cross-entropy benchmarkFthat measures this correlation behaves as$$F=\text {exp}(-2s\epsilon \pm O(s\epsilon ^2))$$$F=\text{exp}(-2sϵ\pm O\left(s{ϵ}^2\right))$, where$$\epsilon $$$ϵ$is the probability of error per circuit location andsis the number of two-qubit gates. Furthermore, if the noise is incoherent—for example, depolarizing or dephasing noise—the total variation distance between the noisy output distribution$$p_{\text {noisy}}$$$p_{\text{noisy}}$and the uniform distribution$$p_{\text {unif}}$$$p_{\text{unif}}$decays at precisely the same rate. Consequently, the noisy output distribution can be approximated as$$p_{\text {noisy}}\approx Fp_{\text {ideal}}+ (1-F)p_{\text {unif}}$$$p_{\text{noisy}}\approx F{p}_{\text{ideal}}+(1-F)p_{\text{unif}}$. In other words, although at least one local error occurs with probability$$1-F$$$1-F$, the errors are scrambled by the random quantum circuit and can be treated as global white noise, contributing completely uniform output. Importantly, we upper bound the average total variation error in this approximation by$$O(F\epsilon \sqrt{s})$$$O\left(Fϵ\sqrt{s}\right)$. Thus, the “white-noise approximation” is meaningful when$$\epsilon \sqrt{s} \ll 1$$$ϵ\sqrt{s}\ll 1$, a quadratically weaker condition than the$$\epsilon s\ll 1$$$ϵs\ll 1$requirement to maintain high fidelity. The bound applies if the circuit size satisfies$$s \ge \Omega (n\log (n))$$$s\ge \Omega (nlog(n\left)\right)$, which corresponds to onlylogarithmic depthcircuits, and if, additionally, the inverse error rate satisfies$$\epsilon ^{-1} \ge {\tilde{\Omega }}(n)$$${ϵ}^{-1}\ge \tilde{\Omega }\left(n\right)$, which is needed to ensure errors are scrambled faster thanFdecays. The white-noise approximation is useful for salvaging the signal from a noisy quantum computation; for example, it was an underlying assumption in complexity-theoretic arguments that noisy random quantum circuits cannot be efficiently sampled classically, even when the fidelity is low. Our method is based on a map from second-moment quantities in random quantum circuits to expectation values of certain stochastic processes for which we compute upper and lower bounds.

    

   more » « less
4. Enhancing the sensitivity of an atom interferometer to the Heisenberg limit using increased quantum noise

   https://doi.org/10.1364/JOSAB.396358  

   Fang, Renpeng ; Sarkar, Resham ; Shahriar, Selim M. ( June 2020 , Journal of the Optical Society of America B)

   In a conventional atomic interferometer employing$N$atoms, the phase sensitivity is at the standard quantum limit:$1/\sqrt{N}$. Under usual spin squeezing, the sensitivity is increased by lowering the quantum noise. It is also possible to increase the sensitivity by leaving the quantum noise unchanged while producing phase amplification. Here we show how to increase the sensitivity, to the Heisenberg limit of$1/N$, while increasing the quantum noise by$\sqrt{N}$and amplifying the phase by a factor of$N$. Because of the enhancement of the quantum noise and the large phase magnification, the effect of excess noise is highly suppressed. The protocol uses a Schrödinger cat state representing a maximally entangled superposition of two collective states of$N$atoms. The phase magnification occurs when we use either atomic state detection or collective state detection; however, the robustness against excess noise occurs only when atomic state detection is employed. We show that for one version of the protocol, the signal amplitude is$N$when$N$is even, and is vanishingly small when$N$is odd, for both types of detection. We also show how the protocol can be modified to reverse the nature of the signal for odd versus even values of$N$. Thus, for a situation where the probability of$N$being even or odd is equal, the net sensitivity is within a factor of$\sqrt{2}$of the Heisenberg limit. Finally, we discuss potential experimental constraints for implementing this scheme via one-axis-twist squeezing employing the cavity feedback scheme, and show that the effects of cavity decay and spontaneous emission are highly suppressed because of the increased quantum noise and the large phase magnification inherent to the protocol. As a result, we find that the maximum improvement in sensitivity can be close to the ideal limit for as many as 10 million atoms.

    

   more » « less
5. Velocity-resolved Reverberation Mapping of NGC 3227

   https://doi.org/10.3847/1538-4357/ad08b8  

   Bentz, Misty C. ; Markham, Madison ; Rosborough, Sara ; Onken, Christopher A. ; Street, Rachel ; Valluri, Monica ; Treu, Tommaso ( December 2023 , The Astrophysical Journal)

   We describe the results of a new reverberation mapping program focused on the nearby Seyfert galaxy NGC 3227. Photometric and spectroscopic monitoring was carried out from 2022 December to 2023 June with the Las Cumbres Observatory network of telescopes. We detected time delays in several optical broad emission lines, with Hβhaving the longest delay at${\tau }_{\mathrm{cent}}={4.0}_{-0.9}^{+0.9}$days and Heiihaving the shortest delay with${\tau }_{\mathrm{cent}}={0.9}_{-0.8}^{+1.1}$days. We also detect velocity-resolved behavior of the Hβemission line, with different line-of-sight velocities corresponding to different observed time delays. Combining the integrated Hβtime delay with the width of the variable component of the emission line and a standard scale factor suggests a black hole mass of$M_{\mathrm{BH}}={1.1}_{-0.3}^{+0.2}\times {10}^7$M_⊙. Modeling of the full velocity-resolved response of the Hβemission line with the phenomenological codeCARAMELfinds a similar mass of$M_{\mathrm{BH}}={1.2}_{-0.7}^{+1.5}\times {10}^7$M_⊙and suggests that the Hβ-emitting broad-line region (BLR) may be represented by a biconical or flared disk structure that we are viewing at an inclination angle ofθ_i≈ 33° and with gas motions that are dominated by rotation. The new photoionization-based BLR modeling toolBELMACfinds general agreement with the observations when assuming the best-fitCARAMELresults; however,BELMACprefers a thick-disk geometry and kinematics that are equally composed of rotation and inflow. Both codes infer a radially extended and flattened BLR that is not outflowing.

    

   more » « less