Related papers: Comments on `Stable Quantum Computation of Unstabl…
Classical chaotic systems are distinguished by their sensitive dependence on initial conditions. The absence of this property in quantum systems has lead to a number of proposals for perturbation-based characterizations of quantum chaos,…
Even after decades of quantum computing development, examples of generally useful quantum algorithms with exponential speedups over classical counterparts are scarce. Recent progress in quantum algorithms for linear-algebra positioned…
Quantum algorithms can potentially solve a handful of problems more efficiently than their classical counterparts. In that context, it has been discussed that Markov chains problems could be solved significantly faster using quantum…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…
Major breakthrough in quantum computation has recently been achieved using quantum annealing to develop analog quantum computers instead of gate based computers. After a short introduction to quantum computation, we retrace very briefly the…
Quantum effects like entanglement and coherent amplification can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits. However, challenges such as decoherence and time-dependent errors hinder…
We use the effective potential method of quantum field theory to obtain the quantum corrections to the zero temperature phase diagram of systems with competing order parameters. We are particularly interested in two different scenarios:…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation, so…
While there is strong evidence for advantages of quantum over classical computation, the repertoire of computational primitives with proven or conjectured quantum advantage remains limited. A big challenge of quantum algorithmic design is a…
The accelerated development of quantum technology has reached a pivotal point. Early in 2014, several results were published demonstrating that several experimental technologies are now accurate enough to satisfy the requirements of…
We give a computational complexity argument against the feasibility of quantum computers. We identify a very low complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explain why it will…
In a number of papers it has been claimed that the time machine are quantum unstable, which manifests itself in the divergence of the vacuum expectation value of the stress-energy tensor $\langle{\bf T}\rangle$ near the Cauchy horizon. The…
In [arXiv:2409.00161v1 (2024)] Cavendish et al. raise three criticisms against our time of arrival proposal [L. Maccone and K. Sacha, Phys. Rev. Lett. 124, 110402 (2020)]. Here we show that all three criticisms are without merit. One of…
We develop dynamical non-Markovian description of quantum computing in weak coupling limit, in lowest order approximation. We show that long range memory of quantum reservoir produces strong interrelation between structure of noise and…
The quantum to classical transition has been shown to depend on a number of parameters. Key among these are a scale length for the action, $\hbar$, a measure of the coupling between a system and its environment, $D$, and, for chaotic…
The problem of the quantitative degradation of the performance of a quantum computer due to noisy unitary gates (imperfect external control) is studied. It is shown that quite general conclusions on the evolution of the fidelity can be…
In quant-ph/9812017v2 M.B. Mensky reviewed our application of the restricted path integral approach to quantum measurements of energy. In this comment we point out that Mensky's assessment of our results is incorrect.
Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in…
Quantum computation is a topic of significant recent interest, with practical advances coming from both research and industry. A major challenge in quantum programming is dealing with errors (quantum noise) during execution. Because quantum…