اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRealizing quantum linear regression with auxiliary qumodes
253
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In order to exploit quantum advantages, quantum algorithms are indispensable for operating machine learning with quantum computers. We here propose an intriguing hybrid approach of quantum information processing for quantum linear regression, which utilizes both discrete and continuous quantum variables, in contrast to existing wisdoms based solely upon discrete qubits. In our framework, data information is encoded in a qubit system, while information processing is tackled using auxiliary continuous qumodes via qubit-qumode interactions. Moreover, it is also elaborated that finite squeezing is quite helpful for efficiently running the quantum algorithms in realistic setup. Comparing with an all-qubit approach, the present hybrid approach is more efficient and feasible for implementing quantum algorithms, still retaining exponential quantum speed-up.
قيم البحث
اقرأ أيضاً
In this paper, we study extended linear regression approaches for quantum state tomography based on regularization techniques. For unknown quantum states represented by density matrices, performing measurements under certain basis yields random outco
mes, from which a classical linear regression model can be established. First of all, for complete or over-complete measurement bases, we show that the empirical data can be utilized for the construction of a weighted least squares estimate (LSE) for quantum tomography. Taking into consideration the trace-one condition, a constrained weighted LSE can be explicitly computed, being the optimal unbiased estimation among all linear estimators. Next, for general measurement bases, we show that $ell_2$-regularization with proper regularization gain provides even lower mean-square error under a cost in bias. The regularization parameter is tuned by two estimators in terms of a risk characterization. Finally, a concise and unified formula is established for the regularization parameter with complete measurement basis under an equivalent regression model, which proves that the proposed tuning estimators are asymptotically optimal as the number of samples grows to infinity under the risk metric. Additionally, numerical examples are provided to validate the established results.
With the rise of quantum technologies, it is necessary to have practical and preferably non-destructive methods to measure and read-out from such devices. A current line of research towards this has focussed on the use of ancilla systems which couple
to the system under investigation, and through their interaction, enable properties of the primary system to be imprinted onto and inferred from the ancillae. We propose the use of continuous variable qumodes as ancillary probes, and show that the interaction Hamiltonian can be fully characterised and directly sampled from measurements of the qumode alone. We suggest how such probes may also be used to determine thermodynamical properties, including reconstruction of the partition function. We show that the method is robust to realistic experimental imperfections such as finite-sized measurement bins and squeezing, and discuss how such probes are already feasible with current experimental setups.
Robust and high-precision quantum control is crucial but challenging for scalable quantum computation and quantum information processing. Traditional adiabatic control suffers severe limitations on gate performance imposed by environmentally induced
noise because of a quantum systems limited coherence time. In this work, we experimentally demonstrate an alternative approach {to quantum control} based on deep reinforcement learning (DRL) on a trapped $^{171}mathrm{Yb}^{+}$ ion. In particular, we find that DRL leads to fast and robust {digital quantum operations with running time bounded by shortcuts to adiabaticity} (STA). Besides, we demonstrate that DRLs robustness against both Rabi and detuning errors can be achieved simultaneously without any input from STA. Our experiments reveal a general framework of digital quantum control, leading to a promising enhancement in quantum information processing.
Intermediate-scale quantum technologies provide unprecedented opportunities for scientific discoveries while posing the challenge of identifying important problems that can take advantage of them through algorithmic innovations. A major open problem
in quantum many-body physics is the table-top generation and detection of emergent excitations analogous to gravitons -- the elusive mediators of gravitational force in a quantum theory of gravity. In solid-state materials, fractional quantum Hall phases are one of the leading platforms for realizing graviton-like excitations. However, their direct observation remains an experimental challenge. Here, we generate these excitations on the IBM quantum processor. We first identify an effective one-dimensional model that captures the geometric properties and graviton dynamics of fractional quantum Hall states. We then develop an efficient, optimal-control-based variational quantum algorithm to simulate geometric quench and the subsequent graviton dynamics, which we successfully implement on the IBM quantum computer. Our results open a new avenue for studying the emergence of gravitons in a new class of tractable models that lend themselves to direct implementations on the existing quantum hardware.
In many predictive decision-making scenarios, such as credit scoring and academic testing, a decision-maker must construct a model that accounts for agents propensity to game the decision rule by changing their features so as to receive better decisi
ons. Whereas the strategic classification literature has previously assumed that agents outcomes are not causally affected by their features (and thus that strategic agents goal is deceiving the decision-maker), we join concurrent work in modeling agents outcomes as a function of their changeable attributes. As our main contribution, we provide efficient algorithms for learning decision rules that optimize three distinct decision-maker objectives in a realizable linear setting: accurately predicting agents post-gaming outcomes (prediction risk minimization), incentivizing agents to improve these outcomes (agent outcome maximization), and estimating the coefficients of the true underlying model (parameter estimation). Our algorithms circumvent a hardness result of Miller et al. (2020) by allowing the decision maker to test a sequence of decision rules and observe agents responses, in effect performing causal interventions through the decision rules.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
