5632 research outputs found
Sort by
Efficient Source of Shaped Single Photons Based on an Integrated Diamond Nanophotonic System
No full textAn efficient, scalable source of shaped single photons that can be directly integrated with optical fiber networks and quantum memories is at the heart of many protocols in quantum information science. We demonstrate a deterministic source of arbitrarily temporally shaped single-photon pulses with high efficiency [detection efficiency = 14.9%] and purity [g^(2)(0) = 0.0168 ] and streams of up to 11 consecutively detected single photons using a silicon-vacancy center in a highly directional fiber-integrated diamond nanophotonic cavity. Combined with previously demonstrated spin-photon entangling gates, this system enables on-demand generation of streams of correlated photons such as cluster states and could be used as a resource for robust transmission and processing of quantum information
Effective GPU Parallelization of Distributed and Localized Model Predictive Control
No full textTo effectively control large-scale distributed systems online, model predictive control (MPC) has to swiftly solve the underlying high-dimensional optimization. There are multiple techniques applied to accelerate the solving process in the literature, mainly attributed to software-based algorithmic advancements and hardware-assisted computation enhancements. However, those methods focus on arithmetic accelerations and overlook the benefits of the underlying system’s structure. In particular, the existing decoupled software-hardware algorithm design that naively parallelizes the arithmetic operations by the hardware does not tackle the hardware overheads such as CPU-GPU and thread-to-thread communications in a principled manner. Also, the advantages of parallelizable subproblem decomposition in distributed MPC are not well recognized and exploited. As a result, we have not reached the full potential of hardware acceleration for MPC.In this paper, we explore those opportunities by leveraging GPU to parallelize the distributed and localized MPC (DLMPC) algorithm. We exploit the locality constraints embedded in the DLMPC formulation to reduce the hardware-intrinsic communication overheads. Our parallel implementation achieves up to 50× faster runtime than its CPU counterparts under various parameters. Furthermore, we find that the locality-aware GPU parallelization could halve the optimization runtime comparing to the naive acceleration. Overall, our results demonstrate the performance gains brought by software-hardware co-design with the information exchange structure in mind
The Panchromatic Hubble Andromeda Treasury: Triangulum Extended Region (PHATTER). II. The Spatially Resolved Recent Star Formation History of M33
No full textWe measure the spatially resolved recent star formation history (SFH) of M33 using optical images taken with the Hubble Space Telescope as part of the Panchromatic Hubble Andromeda Treasury: Triangulum Extended Region (PHATTER) survey. The area covered by the observations used in this analysis covers a de-projected area of ∼38 kpc² and extends to ∼3.5 and ∼2 kpc from the center of M33 along the major and semimajor axes, respectively. We divide the PHATTER optical survey into 2005 regions that measure 24 arcsec, ∼100 pc, on a side and fit color–magnitude diagrams for each region individually to measure the spatially resolved SFH of M33 within the PHATTER footprint. There are significant fluctuations in the SFH on small spatial scales and also galaxy-wide scales that we measure back to about 630 Myr ago. We observe a more flocculent spiral structure in stellar populations younger than about 80 Myr, while the structure of the older stellar populations is dominated by two spiral arms. We also observe a bar in the center of M33, which dominates at ages older than about 80 Myr. Finally, we find that the mean star formation rate (SFR) over the last 100 Myr within the PHATTER footprint is 0.32 ± 0.02 M_⊙ yr⁻¹. We measure a current SFR (over the last 10 Myr) of 0.20 ± 0.03 M_⊙ yr⁻¹. This SFR is slightly higher than previous measurements from broadband estimates, when scaled to account for the fraction of the D25 area covered by the PHATTER survey footprint
Classification of small triorthogonal codes
No full textTriorthogonal codes are a class of quantum error-correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with n+k≤38, where n is the number of physical qubits and k is the number of logical qubits of the code. We find 38 distinguished triorthogonal subspaces, and we show that every triorthogonal code with n+k≤38 descends from one of these subspaces through elementary operations such as puncturing and deleting qubits. Specifically, we associate each triorthogonal code with a Reed-Muller polynomial of weight n+k, and we classify the Reed-Muller polynomials of low weight using the results of Kasami, Tokura, and Azumi [IEEE Trans. Inf. Theory 16, 752 (1970); Inf. Contr. 30, 380 (1976)] and an extensive computerized search. In an Appendix independent of the main text, we improve a magic state distillation protocol by reducing the time variance due to stochastic Clifford corrections
A Plausible Mechanism of Uracil Photohydration Involves an Unusual Intermediate
No full textIt is well-known that photolysis of pyrimidine nucleobases, such as uracil, in an aqueous environment results in the formation of hydrate as one of the main products. Although several hypotheses regarding photohydration have been proposed in the past, e.g., the zwitterionic and “hot” ground-state mechanisms, its detailed mechanism remains elusive. Here, theoretical nonadiabatic simulations of the uracil photodynamics reveal the formation of a highly energetic but kinetically stable intermediate that features a half-chair puckered pyrimidine ring and a strongly twisted intracyclic double bond. The existence and the kinetic stability of the intermediate are confirmed by a variety of computational chemistry methods. According to the simulations, the unusual intermediate is mainly formed almost immediately (∼50–200 fs) upon photoabsorption and survives long enough to engage in a hydration reaction with a neighboring water. A plausible mechanism of uracil photohydration is proposed on the basis of the modeling of nucleophilic insertion of water into the twisted double bond of the intermediate
UP-DOWN states and ripples differentially modulate membrane potential dynamics across DG, CA3, and CA1 in awake mice
No full textHippocampal ripples are transient population bursts that structure cortico-hippocampal communication and play a central role in memory processing. However, the mechanisms controlling ripple initiation in behaving animals remain poorly understood. Here we combine multisite extracellular and whole-cell recordings in awake mice to contrast the brain state and ripple modulation of subthreshold dynamics across hippocampal subfields. We find that entorhinal input to the dentate gyrus (DG) exhibits UP and DOWN dynamics with ripples occurring exclusively in UP states. While elevated cortical input in UP states generates depolarization in DG and CA1, it produces persistent hyperpolarization in CA3 neurons. Furthermore, growing inhibition is evident in CA3 throughout the course of the ripple buildup, while DG and CA1 neurons exhibit depolarization transients 100 ms before and during ripples. These observations highlight the importance of CA3 inhibition for ripple generation, while pre-ripple responses indicate a long and orchestrated ripple initiation process in the awake state
Multiscale Elliptic PDE Upscaling and Function Approximation via Subsampled Data
No full textThere is an intimate connection between numerical upscaling of multiscale PDEs and scattered data approximation of heterogeneous functions: the coarse variables selected for deriving an upscaled equation (in the former) correspond to the sampled information used for approximation (in the latter). As such, both problems can be thought of as recovering a target function based on some coarse data that are either artificially chosen by an upscaling algorithm or determined by some physical measurement process. The purpose of this paper is then to study, under such a setup and for a specific elliptic problem, how the lengthscale of the coarse data, which we refer to as the subsampled lengthscale, influences the accuracy of recovery, given limited computational budgets. Our analysis and experiments identify that reducing the subsampling lengthscale may improve the accuracy, implying a guiding criterion for coarse-graining or data acquisition in this computationally constrained scenario, especially leading to direct insights for the implementation of the Gamblets method in the numerical homogenization literature. Moreover, reducing the lengthscale to zero may lead to a blow-up of approximation error if the target function does not have enough regularity, suggesting the need for a stronger prior assumption on the target function to be approximated. We introduce a singular weight function to deal with it, both theoretically and numerically. This work sheds light on the interplay of the lengthscale of coarse data, the computational costs, the regularity of the target function, and the accuracy of approximations and numerical simulations
A criterion for the stability of planets in chains of resonances
No full textUncovering the formation process that reproduces the distinct properties of compact super-Earth exoplanet systems is a major goal of planet formation theory. The most successful model argues that non-resonant systems begin as resonant chains of planets that later experience a dynamical instability. However, both the boundary of stability in resonant chains and the mechanism of the instability itself are poorly understood. Previous work postulated that a secondary resonance between the fastest libration frequency and a difference in synodic frequencies destabilizes the system. Here, we use that hypothesis to produce a simple and general criterion for resonant chain stability that depends only on planet orbital periods and masses. We show that the criterion accurately predicts the maximum mass of planets in synthetic resonant chains up to six planets. More complicated resonant chains produced in population synthesis simulations are found to be less stable than expected, although our criterion remains useful and superior to machine learning models
Heterogeneous iodine-organic chemistry fast-tracks marine new particle formation
No full textThe gas-phase formation of new particles less than 1 nm in size and their subsequent growth significantly alters the availability of cloud condensation nuclei (CCN, >30–50 nm), leading to impacts on cloud reflectance and the global radiative budget. However, this growth cannot be accounted for by condensation of typical species driving the initial nucleation. Here, we present evidence that nucleated iodine oxide clusters provide unique sites for the accelerated growth of organic vapors to overcome the coagulation sink. Heterogeneous reactions form low-volatility organic acids and alkylaminium salts in the particle phase, while further oligomerization of small α-dicarbonyls (e.g., glyoxal) drives the particle growth. This identified heterogeneous mechanism explains the occurrence of particle production events at organic vapor concentrations almost an order of magnitude lower than those required for growth via condensation alone. A notable fraction of iodine associated with these growing particles is recycled back into the gas phase, suggesting an effective transport mechanism for iodine to remote regions, acting as a “catalyst” for nucleation and subsequent new particle production in marine air
On the Benefit of Cooperation in Relay Networks
No full textThis work addresses the cooperation facilitator (CF) model, in which network nodes coordinate through a rate limited communication device. For multiple-access channel (MAC) encoders, the CF model is known to show significant rate benefits, even when the rate of cooperation is negligible. Specifically, the benefit in MAC sum-rate, as a function of the cooperation rate C_(CF) , sometimes has an infinite slope at C_(CF) = 0 when the CF enables transmitter dependence where none was possible otherwise. This work asks whether cooperation through a CF can yield similar infinite-slope benefits when dependence among MAC transmitters has no benefit or when it can be established without the help of the CF. Specifically, this work studies the CF model when applied to relay nodes of a single-source, single-terminal, diamond network comprising a broadcast channel followed by a MAC. In the relay channel with orthogonal receiver components, careful generalization of the partial-decode-forward/compress-forward lower bound to the CF model yields sufficient conditions for an infinite-slope benefit. Additional results include derivation of a family of diamond networks for which the infinite-slope rate-benefit derives directly from the properties of the corresponding MAC studied in isolation