اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNumerical and analytical research of the impact of decoherence on quantum circuits
86
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Three different levels of noisy quantum schemes modeling are considered: vectors, density matrices and Choi-Jamiolkowski related states. The implementations for personal computers and supercomputers are described, and the corresponding results are shown. For the level of density matrices, we present the technique of the fixed rank approximation and show some analytical estimates of the fidelity level.
قيم البحث
اقرأ أيضاً
We study quantum decoherence numerically in a system consisting of a relativistic quantum field theory coupled to a measuring device that is itself coupled to an environment. The measuring device and environment are treated as quantum, non-relativist
ic particles. We solve the Schrodinger equation for the wave function of this tripartite system using exact diagonalization. Although computational limitations on the size of the Hilbert space prevent us from exploring the regime where the device and environment consist of a truly macroscopic number of degrees of freedom, we nevertheless see clear evidence of decoherence: after tracing out the environment, the density matrix describing the system and measuring device evolves quickly towards a matrix that is close to diagonal in a subspace of pointer states.
We investigate the theoretical limits of the effect of the quantum interaction distance on the speed of exact quantum addition circuits. For this study, we exploit graph embedding for quantum circuit analysis. We study a logical mapping of qubits and
gates of any $Omega(log n)$-depth quantum adder circuit for two $n$-qubit registers onto a practical architecture, which limits interaction distance to the nearest neighbors only and supports only one- and two-qubit logical gates. Unfortunately, on the chosen $k$-dimensional practical architecture, we prove that the depth lower bound of any exact quantum addition circuits is no longer $Omega(log {n})$, but $Omega(sqrt[k]{n})$. This result, the first application of graph embedding to quantum circuits and devices, provides a new tool for compiler development, emphasizes the impact of quantum computer architecture on performance, and acts as a cautionary note when evaluating the time performance of quantum algorithms.
The diverging responses to parameter variations of systems at quantum critical points motivate schemes of quantum metrology that feature sub-Heisenberg scaling of the sensitivity with the system size (e.g., the number of particles). This sensitivity
enhancement is fundamentally rooted in the formation of Schrodinger cat states, or macroscopic superposition states at the quantum critical points. The cat states, however, are fragile to decoherence caused by local noises on individual particles or coupling to local environments, since the local decoherence of any particle would cause the collapse of the whole cat state. Therefore, it is unclear whether the sub-Heisenberg scaling of quantum critical metrology is robust against the local decoherence. Here we study the effects of local decoherence on the quantum critical metrology, using a one-dimensional transverse-field Ising model as a representative example. Based on a previous work [Phys. Rev. Lett. 94, 047201 (2005)] on the critical behaviors of the noisy Ising model, which shows that the universality class of the quantum criticality is modified by the decoherence, we find that the standard quantum limit is recovered by the single-particle decoherence, which is equivalent to local quantum measurement conducted by the environment and destroys the many-body entanglement in the ground state at the quantum critical point. Following the renormalization group analysis [Phys. Rev. B 69, 054426 (2004)], we argue that the noise effects on quantum critical metrology should be universal. This works demonstrates the importance of protecting macroscopic quantum coherence for quantum sensing based on critical behaviors.
The dynamical evolution of a quantum register of arbitrary length coupled to an environment of arbitrary coherence length is predicted within a relevant model of decoherence. The results are reported for quantum bits (qubits) coupling individually to
different environments (`independent decoherence) and qubits interacting collectively with the same reservoir (`collective decoherence). In both cases, explicit decoherence functions are derived for any number of qubits. The decay of the coherences of the register is shown to strongly depend on the input states: we show that this sensitivity is a characteristic of $both$ types of coupling (collective and independent) and not only of the collective coupling, as has been reported previously. A non-trivial behaviour (recoherence) is found in the decay of the off-diagonal elements of the reduced density matrix in the specific situation of independent decoherence. Our results lead to the identification of decoherence-free states in the collective decoherence limit. These states belong to subspaces of the systems Hilbert space that do not get entangled with the environment, making them ideal elements for the engineering of ``noiseless quantum codes. We also discuss the relations between decoherence of the quantum register and computational complexity based on the new dynamical results obtained for the register density matrix.
We provide evidence that commonly held intuitions when designing quantum circuits can be misleading. In particular we show that: a) reducing the T-count can increase the total depth; b) it may be beneficial to trade CNOTs for measurements in NISQ cir
cuits; c) measurement-based uncomputation of relative phase Toffoli ancillae can make up to 30% of a circuits depth; d) area and volume cost metrics can misreport the resource analysis. Our findings assume that qubits are and will remain a very scarce resource. The results are applicable for both NISQ and QECC protected circuits. Our method uses multiple ways of decomposing Toffoli gates into Clifford+T gates. We illustrate our method on addition and multiplication circuits using ripple-carry. As a byproduct result we show systematically that for a practically significant range of circuit widths, ripple-carry addition circuits are more resource efficient than the carry-lookahead addition ones. The methods and circuits were implemented in the open-source QUANTIFY software.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
