Related papers: Quantum Defragmentation Algorithm
We show that specific quantum noise, acting as an open-system reservoir for non-locally entangled atoms, can serve to preserve rather than degrade joint coherence. This creates a new type of long-time control over hiding and recovery of…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Although quantum computing hardware has evolved significantly in recent years, spurred by increasing industrial and government interest, the size limitation of current generation quantum computers remains an obstacle when applying these…
The construction of large, coherent quantum systems necessary for quantum computation remains an entreating but elusive goal, due to the ubiquitous nature of decoherence. Recent progress in quantum error correction schemes have given new…
A variety of tasks in quantum control, ranging from purification and cooling, to quantum stabilization and open-system simulation, rely on the ability to implement a target quantum channel over a specified time interval within prescribed…
Due to omnipresent environmental interferences, quantum coherences inevitably undergo irreversible transformations over certain time-scales, thus leading to the loss of encoded information. This process, known as decoherence, has been a…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…
To use quantum systems for technological applications we first need to preserve their coherence for macroscopic timescales, even at finite temperature. Quantum error correction has made it possible to actively correct errors that affect a…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
Quantum information processing requires overcoming decoherence---the loss of "quantumness" due to the inevitable interaction between the quantum system and its environment. One approach towards a solution is quantum dynamical decoupling---a…
Quantum information processing offers promising advances for a wide range of fields and applications, provided that we can efficiently assess the performance of the control applied in candidate systems. That is, we must be able to determine…
The relative power of quantum algorithms, using an adaptive access to quantum devices, versus classical post-processing methods that rely only on an initial quantum data set, remains the subject of active debate. Here, we present evidence…
Simulating open quantum systems on quantum computers presents a fundamental challenge: open quantum dynamics are intrinsically nonunitary, whereas quantum computers operate through unitary evolution. Conventional approaches overcome this…
Quantum mechanics dictates the band-structure of materials that is essential for functional electronic components. With increased miniaturization of devices, it becomes possible to exploit the full potential of quantum mechanics through the…
Quantum coherence allows for reduced-memory simulators of classical processes. Using recent results in single-shot quantum thermodynamics, we derive a minimal work cost rate for quantum simulators that is quasistatically attainable in the…
In certain classes of physical quantum systems, the exponentially large state space "fragments" into many low-dimensional, dynamically disconnected subspaces. We introduce a learning problem known as fragment classification, where given a…
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…
We develop a new quantum neural network layer designed to run efficiently on a quantum computer but that can be simulated on a classical computer when restricted in the way it entangles input states. We first ask how a classical neural…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…