Searcharxiv⌕ Search

arXiv subjects

Lin Lin

Publications and source records attributed to Lin Lin.

At least 145 records · Page 8Linked to original sources
arXiv2023

Quasi-Periodic Peak Energy Oscillations in X-ray Bursts from SGR J1935+2154

Magnetars are young neutron stars powered by the strongest magnetic fields in the Universe (10$^{13-15}$ G). Their transient X-ray emission usually manifests as short (a few hundred milliseconds), bright, energetic ($\sim$ 10$^{40-41}$ erg) X-ray bursts. Since its discovery in 2014, magnetar J1935+2154 has become one of the most prolific magnetars, exhibiting very active bursting episodes, and other fascinating events such as pulse timing anti-glitches and Fast Radio Bursts. Here, we present evidence for possible 42 Hz (24 ms) quasi-periodic oscillations in the $νF_ν$ spectrum peak energy (Ep) identified in a unique burst detected with the Fermi Gamma-ray Burst Monitor in January 2022. While quasi-periodic oscillations have been previously reported in the intensity of magnetar burst lightcurves, quasi-periodic oscillations in the Ep have not. We also find an additional event from the same outburst that appears to exhibit similar character in Ep, albeit of lower statistical quality. For these two exceptional transients, such Ep oscillations can be explained by magnetospheric density and pressure perturbations. For burst-emitting plasma consisting purely of $e^+e^-$ pairs, these acoustic modes propagate along a highly magnetized flux tube of length up to around $L\sim 130$ neutron star radii, with $L$ being lower if ions are present in the emission zone. Detailed time-resolved analyses of other magnetar bursts are encouraged to evaluate the rarity of these events and their underlying mechanisms.

astro-ph.HE↗
arXiv2023

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well-structured sparse matrices. In this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well-structured sparse matrices, and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

quant-ph↗
arXiv2023

A quantum hamiltonian simulation benchmark

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of $n$-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an `optimal' simulation time $t^{\text{opt}}\approx 4.81$, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

quant-ph↗
arXiv2023

Adaptive Weighted Multi-View Clustering

Learning multi-view data is an emerging problem in machine learning research, and nonnegative matrix factorization (NMF) is a popular dimensionality-reduction method for integrating information from multiple views. These views often provide not only consensus but also complementary information. However, most multi-view NMF algorithms assign equal weight to each view or tune the weight via line search empirically, which can be infeasible without any prior knowledge of the views or computationally expensive. In this paper, we propose a weighted multi-view NMF (WM-NMF) algorithm. In particular, we aim to address the critical technical gap, which is to learn both view-specific weight and observation-specific reconstruction weight to quantify each view's information content. The introduced weighting scheme can alleviate unnecessary views' adverse effects and enlarge the positive effects of the important views by assigning smaller and larger weights, respectively. Experimental results confirm the effectiveness and advantages of the proposed algorithm in terms of achieving better clustering performance and dealing with the noisy data compared to the existing algorithms.

stat.ML↗
arXiv2023

Anti-symmetric Barron functions and their approximation with sums of determinants

A fundamental problem in quantum physics is to encode functions that are completely anti-symmetric under permutations of identical particles. The Barron space consists of high-dimensional functions that can be parameterized by infinite neural networks with one hidden layer. By explicitly encoding the anti-symmetric structure, we prove that the anti-symmetric functions which belong to the Barron space can be efficiently approximated with sums of determinants. This yields a factorial improvement in complexity compared to the standard representation in the Barron space and provides a theoretical explanation for the effectiveness of determinant-based architectures in ab-initio quantum chemistry.

math.NA↗
arXiv2023

Discovery of the linear energy-dependence of the spectral lag of X-ray bursts from SGR J1935+2154

Spectral lag of the low-energy photons with respect to the high-energy ones is a common astrophysical phenomenon (such as Gamma-ray bursts and the Crab pulsar) and may serve as a key probe to the underlying radiation mechanism. However, spectral lag in keV range of the magnetar bursts has not been systematically studied yet. In this work, we perform a detailed spectral lag analysis with the Li-CCF method for SGR J1935+2154 bursts observed by {\it Insight}-HXMT, GECAM and Fermi/GBM from July 2014 to Jan 2022. We discover that the spectral lags of about 61\% (non-zero significance >1$σ$) bursts from SGR J1935+2154 are linearly dependent on the photon energy ($E$) with $t_{\rm lag}(E)=α(E/{\rm keV})+C$, which may be explained by a linear change of the temperature of the blackbody-emitting plasma with time. The distribution of the slope ($α$) approximately follows a Gaussian function with mean and standard deviation of 0.02 ms/keV (i.e. high-energy photons arrive earlier) and 0.02 ms/keV, respectively. We also find that the distribution can be well fitted with three Gaussians with mean values of $\sim$ -0.009, 0.013 and 0.039 ms/keV, which may correspond to different origins of the bursts. These spectral lag features may have important implications on the magnetar bursts.

astro-ph.HE↗
arXiv2023

Time-marching based quantum solvers for time-dependent linear differential equations

The time-marching strategy, which propagates the solution from one time step to the next, is a natural strategy for solving time-dependent differential equations on classical computers, as well as for solving the Hamiltonian simulation problem on quantum computers. For more general linear differential equations, a time-marching based quantum solver can suffer from exponentially vanishing success probability with respect to the number of time steps and is thus considered impractical. We solve this problem by repeatedly invoking a technique called the uniform singular value amplification, and the overall success probability can be lower bounded by a quantity that is independent of the number of time steps. The success probability can be further improved using a compression gadget lemma. This provides a path of designing quantum differential equation solvers that is alternative to those based on quantum linear systems algorithms (QLSA). We demonstrate the performance of the time-marching strategy with a high-order integrator based on the truncated Dyson series. The complexity of the algorithm depends linearly on the amplification ratio, which quantifies the deviation from a unitary dynamics. We prove that the linear dependence on the amplification ratio attains the query complexity lower bound and thus cannot be improved in the worst case. This algorithm also surpasses existing QLSA based solvers in three aspects: (1) the coefficient matrix $A(t)$ does not need to be diagonalizable. (2) $A(t)$ can be non-smooth, and is only of bounded variation. (3) It can use fewer queries to the initial state. Finally, we demonstrate the time-marching strategy with a first-order truncated Magnus series, while retaining the aforementioned benefits. Our analysis also raises some open questions concerning the differences between time-marching and QLSA based methods for solving differential equations.

quant-ph↗
arXiv2023

Insight-HXMT and GECAM-C observations of the brightest-of-all-time GRB 221009A

GRB 221009A is the brightest gamma-ray burst ever detected since the discovery of this kind of energetic explosions. However, an accurate measurement of the prompt emission properties of this burst is very challenging due to its exceptional brightness. With joint observations of \textit{Insight}-HXMT and GECAM-C, we made an unprecedentedly accurate measurement of the emission during the first $\sim$1800 s of GRB 221009A, including its precursor, main emission (ME, which dominates the burst in flux), flaring emission and early afterglow, in the hard X-ray to soft gamma-ray band from $\sim$ 10 keV to $\sim$ 6 MeV. Based on the GECAM-C unsaturated data of the ME, we measure a record-breaking isotropic equivalent energy ($E_{\rm iso}$) of $\bf \sim 1.5 \times 10^{55}$ erg, which is about eight times the total rest-mass energy of the Sun. The early afterglow data require a significant jet break between 650 s and 1100 s, most likely at $\sim950$ s from the afterglow starting time $T_{AG}$, which corresponds to a jet opening angle of $\sim {0.7^\circ} \ (η_γn)^{1/8}$, where $n$ is the ambient medium density in units of $\rm cm^{-3}$ and $η_γ$ is the ratio between $γ$-ray energy and afterglow kinetic energy. The beaming-corrected total $γ$-ray energy $E_γ$ is $\sim 1.15 \times10^{51} \ (η_γn)^{1/4}$ erg, which is typical for long GRBs. These results suggest that this GRB may have a special central engine, which could launch and collimate a very narrowly beamed jet with an ordinary energy budget, leading to exceptionally luminous gamma-ray radiation per unit solid angle. Alternatively, more GRBs might have such a narrow and bright beam, which are missed by an unfavorable viewing angle or have been detected without distance measurement.

astro-ph.HE↗
arXiv2023

Personalized Pricing with Invalid Instrumental Variables: Identification, Estimation, and Policy Learning

Pricing based on individual customer characteristics is widely used to maximize sellers' revenues. This work studies offline personalized pricing under endogeneity using an instrumental variable approach. Standard instrumental variable methods in causal inference/econometrics either focus on a discrete treatment space or require the exclusion restriction of instruments from having a direct effect on the outcome, which limits their applicability in personalized pricing. In this paper, we propose a new policy learning method for Personalized pRicing using Invalid iNsTrumental variables (PRINT) for continuous treatment that allow direct effects on the outcome. Specifically, relying on the structural models of revenue and price, we establish the identifiability condition of an optimal pricing strategy under endogeneity with the help of invalid instrumental variables. Based on this new identification, which leads to solving conditional moment restrictions with generalized residual functions, we construct an adversarial min-max estimator and learn an optimal pricing strategy. Furthermore, we establish an asymptotic regret bound to find an optimal pricing strategy. Finally, we demonstrate the effectiveness of the proposed method via extensive simulation studies as well as a real data application from an US online auto loan company.

stat.ME↗
arXiv2023

The 2022 high-energy outburst and radio disappearing act of the magnetar 1E 1547.0-5408

We report the radio and high-energy properties of a new outburst from the radio-loud magnetar 1E 1547.0$-$5408. Following the detection of a short burst from the source with Swift-BAT on 2022 April 7, observations by NICER detected an increased flux peaking at $(6.0 \pm 0.4) \times 10^{-11}$ erg s$^{-1}$ cm$^{-2}$ in the soft X-ray band, falling to the baseline level of $1.7\times10^{-11}$ erg s$^{-1}$ cm$^{-2}$ over a 17-day period. Joint spectroscopic measurements by NICER and NuSTAR indicated no change in the hard non-thermal tail despite the prominent increase in soft X-rays. Observations at radio wavelengths with Murriyang, the 64-m Parkes radio telescope, revealed that the persistent radio emission from the magnetar disappeared at least 22 days prior to the initial Swift-BAT detection and was re-detected two weeks later. Such behavior is unprecedented in a radio-loud magnetar, and may point to an unnoticed slow rise in the high-energy activity prior to the detected short-bursts. Finally, our combined radio and X-ray timing revealed the outburst coincided with a spin-up glitch, where the spin-frequency and spin-down rate increased by $0.2 \pm 0.1$ $μ$Hz and $(-2.4 \pm 0.1) \times 10^{-12}$ s$^{-2}$ respectively. A linear increase in spin-down rate of $(-2.0 \pm 0.1) \times 10^{-19}$ s$^{-3}$ was also observed over 147 d of post-outburst timing. Our results suggest that the outburst may have been associated with a reconfiguration of the quasi-polar field lines, likely signalling a changing twist, accompanied by spatially broader heating of the surface and a brief quenching of the radio signal, yet without any measurable impact on the hard X-ray properties.

astro-ph.HE↗
arXiv2023

Finite-size effects in periodic coupled cluster calculations

We provide the first rigorous study of the finite-size error in the simplest and representative coupled cluster theory, namely the coupled cluster doubles (CCD) theory, for gapped periodic systems. Assuming that the CCD equations are solved using exact Hartree-Fock orbitals and orbital energies, we prove that the convergence rate of finite-size error scales as $\mathscr{O}(N_\mathbf{k}^{-\frac13})$, where $N_{\mathbf{k}}$ is the number of discretization point in the Brillouin zone and characterizes the system size. Our analysis shows that the dominant error lies in the coupled cluster amplitude calculation, and the convergence of the finite-size error in energy calculations can be boosted to $\mathscr{O}(N_\mathbf{k}^{-1})$ with accurate amplitudes. This also provides the first proof of the scaling of the finite-size error in the third order Møller-Plesset perturbation theory (MP3) for periodic systems.

math.NA↗
arXiv2022

Interacting models for twisted bilayer graphene: a quantum chemistry approach

The nature of correlated states in twisted bilayer graphene (TBG) at the magic angle has received intense attention in recent years. We present a numerical study of an interacting Bistritzer-MacDonald (IBM) model of TBG using a suite of methods in quantum chemistry, including Hartree-Fock, coupled cluster singles, doubles (CCSD), and perturbative triples (CCSD(T)), as well as a quantum chemistry formulation of the density matrix renormalization group method (DMRG). Our treatment of TBG is agnostic to gauge choices, and hence we present a new gauge-invariant formulation to detect the spontaneous symmetry breaking in interacting models. To benchmark our approach, we focus on a simplified spinless, valleyless IBM model. At integer filling ($ν=0$), all numerical methods agree in terms of energy and $C_{2z} \mathcal{T}$ symmetry breaking. Additionally, as part of our benchmarking, we explore the impact of different schemes for removing ``double-counting'' in the IBM model. Our results at integer filling suggest that cross-validation of different IBM models may be needed for future studies of the TBG system. After benchmarking our approach at integer filling, we perform the first systematic study of the IBM model near integer filling (for $|ν|< 0.2$). In this regime, we find that the ground state can be in a metallic and $C_{2z} \mathcal{T}$ symmetry breaking phase. The ground state appears to have low entropy, and therefore can be relatively well approximated by a single Slater determinant. Furthermore, we observe many low entropy states with energies very close to the ground state energy in the near integer filling regime.

cond-mat.str-el↗
arXiv2022

Is there evidence for exponential quantum advantage in quantum chemistry?

The idea to use quantum mechanical devices to simulate other quantum systems is commonly ascribed to Feynman. Since the original suggestion, concrete proposals have appeared for simulating molecular and materials chemistry through quantum computation, as a potential ``killer application''. Indications of potential exponential quantum advantage in artificial tasks have increased interest in this application, thus, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation. We conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for quantum chemistry, it may be prudent to assume exponential speedups are not generically available for this problem.

physics.chem-ph↗
arXiv2022

On the energy landscape of symmetric quantum signal processing

Symmetric quantum signal processing provides a parameterized representation of a real polynomial, which can be translated into an efficient quantum circuit for performing a wide range of computational tasks on quantum computers. For a given polynomial $f$, the parameters (called phase factors) can be obtained by solving an optimization problem. However, the cost function is non-convex, and has a very complex energy landscape with numerous global and local minima. It is therefore surprising that the solution can be robustly obtained in practice, starting from a fixed initial guess $Φ^0$ that contains no information of the input polynomial. To investigate this phenomenon, we first explicitly characterize all the global minima of the cost function. We then prove that one particular global minimum (called the maximal solution) belongs to a neighborhood of $Φ^0$, on which the cost function is strongly convex under the condition ${\left\lVert f\right\rVert}_{\infty}=\mathcal{O}(d^{-1})$ with $d=\mathrm{deg}(f)$. Our result provides a partial explanation of the aforementioned success of optimization algorithms.

quant-ph↗
arXiv2022

Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices

Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block encoding input model of the Hamiltonian, whose implementation is known to require a large resource overhead. We develop a tool called quantum eigenvalue transformation of unitary matrices with real polynomials (QET-U), which uses a controlled Hamiltonian evolution as the input model, a single ancilla qubit and no multi-qubit control operations, and is thus suitable for early fault-tolerant quantum devices. This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. For a class of quantum spin Hamiltonians, we propose a new method that exploits certain anti-commutation relations and further removes the need of implementing the controlled Hamiltonian evolution. Coupled with Trotter based approximation of the Hamiltonian evolution, the resulting algorithm can be very suitable for early fault-tolerant quantum devices. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model. If we are further allowed to use multi-qubit Toffoli gates, we can then implement amplitude amplification and a new binary amplitude estimation algorithm, which increases the circuit depth but decreases the total query complexity. The resulting algorithm saturates the near-optimal complexity for ground state preparation and energy estimating using a constant number of ancilla qubits (no more than 3).

quant-ph↗
arXiv2022

Robust analytic continuation of Green's functions via projection, pole estimation, and semidefinite relaxation

Green's functions of fermions are described by matrix-valued Herglotz-Nevanlinna functions. Since analytic continuation is fundamentally an ill-posed problem, the causal space described by the matrix-valued Herglotz-Nevanlinna structure can be instrumental in improving the accuracy and in enhancing the robustness with respect to noise. We demonstrate a three-pronged procedure for robust analytic continuation called PES: (1) Projection of data to the causal space. (2) Estimation of pole locations. (3) Semidefinite relaxation within the causal space. We compare the performance of PES with the recently developed Nevanlinna and Carathéodory continuation methods and find that PES is more robust in the presence of noise and does not require the usage of extended precision arithmetics. We also demonstrate that a causal projection improves the performance of the Nevanlinna and Carathéodory methods. The PES method is generalized to bosonic response functions, for which the Nevanlinna and Carathéodory continuation methods have not yet been developed. It is particularly useful for studying spectra with sharp features, as they occur in the study of molecules and band structures in solids.

cond-mat.str-el↗
arXiv2022

Interpretable Deep Representation Learning from Temporal Multi-view Data

In many scientific problems such as video surveillance, modern genomics, and finance, data are often collected from diverse measurements across time that exhibit time-dependent heterogeneous properties. Thus, it is important to not only integrate data from multiple sources (called multi-view data), but also to incorporate time dependency for deep understanding of the underlying system. We propose a generative model based on variational autoencoder and a recurrent neural network to infer the latent dynamics for multi-view temporal data. This approach allows us to identify the disentangled latent embeddings across views while accounting for the time factor. We invoke our proposed model for analyzing three datasets on which we demonstrate the effectiveness and the interpretability of the model.

stat.ML↗
arXiv2022

Probabilistic Model Incorporating Auxiliary Covariates to Control FDR

Controlling False Discovery Rate (FDR) while leveraging the side information of multiple hypothesis testing is an emerging research topic in modern data science. Existing methods rely on the test-level covariates while ignoring metrics about test-level covariates. This strategy may not be optimal for complex large-scale problems, where indirect relations often exist among test-level covariates and auxiliary metrics or covariates. We incorporate auxiliary covariates among test-level covariates in a deep Black-Box framework controlling FDR (named as NeurT-FDR) which boosts statistical power and controls FDR for multiple-hypothesis testing. Our method parametrizes the test-level covariates as a neural network and adjusts the auxiliary covariates through a regression framework, which enables flexible handling of high-dimensional features as well as efficient end-to-end optimization. We show that NeurT-FDR makes substantially more discoveries in three real datasets compared to competitive baselines.

stat.ML↗