Related papers: Comments on `Stable Quantum Computation of Unstabl…
We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing…
We study the time evolution of the quantum-classical correspondence (QCC) for the well known model of quantised perturbed cat maps on the torus in the very specific regime of semi-classically small perturbations. The quality of the QCC is…
Angelini, Pellicoro, and Stramaglia [Phys. Rev. E {\bf 60}, R5021 (1999), cond-mat/9907149] (APS) claim that the phase ordering of two-dimensional systems of sequentially-updated chaotic maps with conserved ``order parameter'' does not…
We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…
Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell's Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In…
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum…
A system of quantum computing structures is introduced and proven capable of making emerge, on average, the orbits of classical bounded nonlinear maps on \mathbb{C} through the iterative action of path-dependent quantum gates. The effects…
Quantum superpositions of macroscopically distinct classical states, so-called Schr\"{o}dinger cat states, are a resource for quantum metrology, quantum communication, and quantum computation. In particular, the superpositions of two…
Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical…
We reply to a comment by Averin and Korotkov http://uk.arxiv.org/abs/cond-mat/0404549 on Stace and Barrett, PRL 92, 136802 (2004) http://link.aps.org/abstract/PRL/v92/e136802, showing that their specific criticisms are unfounded, and…
Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature is coined as "quantum supremacy" and one…
In Ref. Ansari et al., dynamical quantum phase transitions (DQPTs) -- non-analyticities in the Loschmidt return rate at critical times -- are investigated in the presence of noise for a two-band model. The authors report that DQPTs persist…
Recently, there has been a surge of interest for quantum computation for its ability to exponentially speed up algorithms, including machine learning algorithms. However, Tang suggested that the exponential speed up can also be done on a…
In realistic hardware for quantum computation that possesses fault-tolerance, non-stationary noise and stochastic drift lead to logical failure from the temporal accumulation of errors, not from independent events. Static decoding and fixed…
In these notes we show that it is impossible to obtain a quantum speedup for a faulty Hamiltonian oracle. The effect of dephasing noise to this continuous time oracle model has first been investigated in [1]. The authors consider a faulty…
We give a classical algorithm for linear regression analogous to the quantum matrix inversion algorithm [Harrow, Hassidim, and Lloyd, Physical Review Letters'09, arXiv:0811.3171] for low-rank matrices [Wossnig, Zhao, and Prakash, Physical…
Two models of computer, a quantum and a classical "chemical machine" designed to compute the relevant part of Shor's factoring algorithm are discussed. The comparison shows that the basic quantum features believed to be responsible for the…
This note presents a few observations on the nonlocal nature of quantum errors and the expected performance of the recently proposed quantum error-correction codes that are based on the assumption that the errors are either bit-flip or…
Decoherence in quantum systems which are classically chaotic is studied. It is well-known that a classically chaotic system when quantized loses many prominent chaotic traits. We show that interaction of the quantum system with an…