SearcharxivSearch

arXiv subjects

V. Rawat

Publications and source records attributed to V. Rawat.

3 recordsLinked to original sources

Star formation efficiency and scaling relations in parsec-scale cluster-forming clumps

Numerical simulations predict that clumps ($\sim$1 pc) should form stars at high efficiency to produce bound star clusters. We conducted a statistical study of 17 nearby cluster-forming clumps to examine the star formation rate and gas mass surface density relations (i.e. $\Sigma_{\rm{SFR}}$ vs. $\Sigma_{\rm{gas}}$) at the clump scale. Using near-infrared point sources and Herschel dust continuum analysis, we obtained the radius, age, and stellar mass for most clusters in the ranges 0.5$-$1.6 pc, 0.5$-$1.5 Myr, 40$-$500 M$_\odot$, respectively, and also found that they are associated with $\Sigma_{\rm{gas}}$ values ranging from 80$-$600 M$_\odot$ pc$^{-2}$. We obtained the best-fit scaling relations as $\Sigma_{\rm{SFR}}$ $\propto$ $\Sigma_{\rm{gas}}^{1.46}$ and $\Sigma_{\rm{SFR}}$ $\propto$ $(\Sigma_{\rm{gas}}/t_{\rm{ff}})^{0.80}$ for the studied sample of clumps. Comparing our results with existing scaling relations at cloud and extragalactic scales, we found that while the power-law exponent obtained in this work is similar to those found at these scales, the star formation rate surface densities are relatively higher for similar gas mass surface densities. From this work, we obtained instantaneous median star formation efficiency (SFE) and efficiency per free-fall time ($\epsilon_{\rm{ff}}$) of $\sim$20% and $\sim$13%, respectively, for the studied clumps. We discuss the cause of the obtained high SFE and $\epsilon_{\rm{ff}}$ in the studied clumps and also discuss the results in the context of bound cluster formation within molecular clouds. We conclude that our results do not favour a universal scaling law with a constant value of $\epsilon_{\rm{ff}}$ in star-forming systems across different scales.

astro-ph.GA

Demonstration of Universal Parametric Entangling Gates on a Multi-Qubit Lattice

We show that parametric coupling techniques can be used to generate selective entangling interactions for multi-qubit processors. By inducing coherent population exchange between adjacent qubits under frequency modulation, we implement a universal gateset for a linear array of four superconducting qubits. An average process fidelity of $\mathcal{F}=93\%$ is estimated for three two-qubit gates via quantum process tomography. We establish the suitability of these techniques for computation by preparing a four-qubit maximally entangled state and comparing the estimated state fidelity against the expected performance of the individual entangling gates. In addition, we prepare an eight-qubit register in all possible bitstring permutations and monitor the fidelity of a two-qubit gate across one pair of these qubits. Across all such permutations, an average fidelity of $\mathcal{F}=91.6\pm2.6\%$ is observed. These results thus offer a path to a scalable architecture with high selectivity and low crosstalk.

quant-ph

Parametrically Activated Entangling Gates Using Transmon Qubits

We describe and implement a family of entangling gates activated by radio-frequency flux modulation applied to a tunable transmon that is statically coupled to a neighboring transmon. The effect of this modulation is the resonant exchange of photons directly between levels of the two-transmon system, obviating the need for mediating qubits or resonator modes and allowing for the full utilization of all qubits in a scalable architecture. The resonance condition is selective in both the frequency and amplitude of modulation and thus alleviates frequency crowding. We demonstrate the use of three such resonances to produce entangling gates that enable universal quantum computation: one iSWAP gate and two distinct controlled Z gates. We report interleaved randomized benchmarking results indicating gate error rates of 6% for the iSWAP (duration 135ns) and 9% for the controlled Z gates (durations 175 ns and 270 ns), limited largely by qubit coherence.

quant-ph