ترغب بنشر مسار تعليمي؟ اضغط هنا

Physical qubit calibration on a directed acyclic graph

52   0   0.0 ( 0 )
 نشر من قبل Julian Kelly
 تاريخ النشر 2018
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

High-fidelity control of qubits requires precisely tuned control parameters. Typically, these parameters are found through a series of bootstrapped calibration experiments which successively acquire more accurate information about a physical qubit. However, optimal parameters are typically different between devices and can also drift in time, which begets the need for an efficient calibration strategy. Here, we introduce a framework to understand the relationship between calibrations as a directed graph. With this approach, calibration is reduced to a graph traversal problem that is automatable and extensible.



قيم البحث

اقرأ أيضاً

The modeling of conversational context plays a vital role in emotion recognition from conversation (ERC). In this paper, we put forward a novel idea of encoding the utterances with a directed acyclic graph (DAG) to better model the intrinsic structur e within a conversation, and design a directed acyclic neural network, namely DAG-ERC, to implement this idea. In an attempt to combine the strengths of conventional graph-based neural models and recurrence-based neural models, DAG-ERC provides a more intuitive way to model the information flow between long-distance conversation background and nearby context. Extensive experiments are conducted on four ERC benchmarks with state-of-the-art models employed as baselines for comparison. The empirical results demonstrate the superiority of this new model and confirm the motivation of the directed acyclic graph architecture for ERC.
135 - Tong Wu , J. A. Izaac , Zi-Xi Li 2019
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of nodes in netw orks represented by graphs. Employing QW in centrality ranking is advantageous comparing to certain widely used classical algorithms (e.g. PageRank) because QW approach can lift the vertex rank degeneracy in certain graphs. However, it is challenging to implement a directed graph via QW, since it corresponds to a non-Hermitian Hamiltonian and thus cannot be accomplished by conventional QW. Here we report the realizations of centrality rankings of both a three-vertex and four-vertex directed graphs with parity-time (PT) symmetric quantum walks. To achieve this, we use high-dimensional photonic quantum states, optical circuitries consisting of multiple concatenated interferometers and dimension dependent loss. Importantly, we demonstrate the advantage of QW approach experimentally by breaking the vertex rank degeneracy in a four-vertex graph. Our work shows that PT-symmetric quantum walks may be useful for realizing advanced algorithm in a quantum network.
Functional connectivity (FC) has been widely used to study brain network interactions underlying the emerging cognition and behavior of an individual. FC is usually defined as the correlation or partial correlation between brain regions. Although FC is proved to be a good starting point to understand the brain organization, it fails to tell the causal relationship or the direction of interactions. Many directed acyclic graph (DAG) based methods were applied to study the directed interactions using functional magnetic resonance imaging (fMRI) data but the performance was severely limited by the small sample size and high dimensionality, hindering its applications. To overcome the obstacles, we propose a score based joint directed acyclic graph model to estimate the directed FC in fMRI data. Instead of using a combinatorial optimization framework, the structure of DAG is characterized with an algebra equation and further regularized with sparsity and group similarity terms. The simulation results have demonstrated the improved accuracy of the proposed model in detecting causality as compared to other existing methods. In our case-control study of the MIND Clinical Imaging Consortium (MCIC) data, we have successfully identified decreased functional integration, disrupted hub structures and characteristic edges (CtEs) in schizophrenia (SZ) patients. Further comparison between the results from directed FC and undirected FC illustrated the their different emphasis on selected features. We speculate that combining the features from undirected graphical model and directed graphical model might be a promising way to do FC analysis.
In this article, we propose a new hypothesis testing method for directed acyclic graph (DAG). While there is a rich class of DAG estimation methods, there is a relative paucity of DAG inference solutions. Moreover, the existing methods often impose s ome specific model structures such as linear models or additive models, and assume independent data observations. Our proposed test instead allows the associations among the random variables to be nonlinear and the data to be time-dependent. We build the test based on some highly flexible neural networks learners. We establish the asymptotic guarantees of the test, while allowing either the number of subjects or the number of time points for each subject to diverge to infinity. We demonstrate the efficacy of the test through simulations and a brain connectivity network analysis.
75 - Paul Jung , Jiho Lee , Sam Staton 2018
Motivated by the problem of designing inference-friendly Bayesian nonparametric models in probabilistic programming languages, we introduce a general class of partially exchangeable random arrays which generalizes the notion of hierarchical exchangea bility introduced in Austin and Panchenko (2014). We say that our partially exchangeable arrays are DAG-exchangeable since their partially exchangeable structure is governed by a collection of Directed Acyclic Graphs. More specifically, such a random array is indexed by $mathbb{N}^{|V|}$ for some DAG $G=(V,E)$, and its exchangeability structure is governed by the edge set $E$. We prove a representation theorem for such arrays which generalizes the Aldous-Hoover and Austin-Panchenko representation theorems.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا