相关论文: Comments on `Stable Quantum Computation of Unstabl…

Gong points out [quant-ph arXiv:1106.0062] a "direct connection" between our measure [PRL 106, 220401 (2011)] recently proposed to quantify macroscopic quantum superpositions and a previously studied quantity introduced to study classical…

A quantum computer is a multi-particle interferometer that comprises beam splitters at both ends and arms, where the n two-level particles undergo the interactions among them. The arms are designed so that relevant functions required to…

Realizing error-corrected logical qubits is a central goal for the current development of digital quantum computers. Neutral atoms offer the opportunity to coherently shuttle atoms for realizing efficient quantum error correction based on…

Firstly the fluctuation theorems (FT) for expended work in a driven nonequilibrium system, isolated or thermostatted, together with the ensuing Jarzynski work-energy (W-E) relationships, will be discussed and reobtained. Secondly, the…

The rapid development of reliable Quantum Processing Units (QPU) opens up novel computational opportunities for machine learning. Here, we introduce a procedure for measuring the similarity between graph-structured data, based on the…

Quantum computing is a game-changing technology for global academia, research centers and industries including computational science, mathematics, finance, pharmaceutical, materials science, chemistry and cryptography. Although it has seen…

The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to…

We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for…

The Loschmidt echo is a measure of the stability and reversibility of quantum evolution under perturbations of the Hamiltonian. One of the expected and most relevant characteristics of this quantity for chaotic systems is an exponential…

Experimental attempts to implement quantum speedup of computations over the past 30 years have yielded a negative result, despite the absence of physical laws prohibiting such speedup. The article formulates the limitation of quantum…

In classical computing, analog approaches have sometimes appeared to be more powerful than they really are. This occurs when resources, particularly precision, are not appropriately taken into account. While the same should also hold for…

Dissipative processes have long been proposed as a means of performing computational tasks on quantum computers that may be intrinsically more robust to noise. In this work, we prove two main results concerning the error-resilience…

In quantum/wave systems with chaotic classical analogs, wavefunctions evolve in highly complex, yet deterministic ways. A slight perturbation of the system, though, will cause the evolution to diverge from its original behavior increasingly…

In arXiv:1202.0691, Geloni et al. criticise our recent work describing the spontaneous emission by a relativistic, undulating electron beam. In particular they claim that our prediction of a quantum regime in which evolution of the electron…

Recursive Fourier Sampling (RFS) was one of the earliest problems to demonstrate a quantum advantage, and is known to lie outside the Merlin--Arthur complexity class. This work contains a new description of quantum algorithms in phase space…

With quantum devices rapidly approaching qualities and scales needed for fault tolerance, the validity of simplified error models underpinning the study of quantum error correction needs to be experimentally evaluated. In this work, we have…

It is argued that the Aharonov-Casher set up could be used as the basic building block for quantum computation. We demonstrate explicitly in this scenario one- and two-qubit phase shift gates that are fault tolerant to deformations of the…

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…

We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…

Albert and Callender have challenged the received view that theories like classical electrodynamics and non-relativistic quantum mechanics are time reversal invariant. They claim that time reversal should correspond to the mere reversal of…