Related papers: Limits of Adiabatic Clocking in Quantum-dot Cellul…
We address theoretically adiabatic regime of charge transport for a model of two tunnel-coupled quantum dots connected in series. The energy levels of the two dots are harmonically modulated by an external potential with a constant phase…
We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow…
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…
Power dissipation is known as the most notable limiting factor in all nano-electronic design techniques including Quantum-dot Cellular Automata (QCA). The familiar reversible computing approach is used as a reasonably reliable solution,…
The application of quantum annealing to the optimization of continuous-variable functions is a relatively unexplored area of research. We test the performance of quantum annealing applied to a one-dimensional continuous-variable function…
We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…
We reveal universal dynamical scaling behavior across adiabatic quantum phase transitions (QPTs) in networks ranging from traditional spatial systems (Ising model) to fully connected ones (Dicke and Lipkin-Meshkov-Glick models). Our…
To optimize the performance of a heat engine in finite-time cycle, it is important to understand the finite-time effect of thermodynamic processes. Previously, we have shown that extra work is needed to complete a quantum adiabatic process…
We come up with a class of distributed quantized averaging algorithms on asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the…
We study theoretically the interaction between the charge dynamics of a few-electron double quantum dot and a capacitively-coupled AFM cantilever, a setup realized in several recent experiments. We demonstrate that the dot-induced frequency…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
We analyze the performance of a quantum Otto cycle, employing time-dependent harmonic oscillator as the working fluid undergoing sudden expansion and compression strokes during the adiabatic stages, coupled to a squeezed reservoir. First,…
Adiabatic quantum optimization has been proposed as a route to solve NP-complete problems, with a possible quantum speedup compared to classical algorithms. However, the precise role of quantum effects, such as entanglement, in these…
In the near future the era of Beyond CMOS will start as the scaling of the current CMOS technology will reach the fundamental limit. QCA (Quantum-dot Cellular Automata) is the transistor less computation paradigm and viable candidate for…
It is shown that optical pulses with a mean position accuracy beyond the standard quantum limit can be produced by adiabatically expanding an optical vector soliton followed by classical dispersion management. The proposed scheme is also…
Long-distance transfer of quantum states is an indispensable part of large-scale quantum information processing. We propose a novel scheme for the transfer of two-electron entangled states, from one edge of a quantum dot array to the other…
In wireless communication networks, it is difficult to solve many NP-hard problems owing to computational complexity and high cost. Recently, quantum annealing (QA) based on quantum physics was introduced as a key enabler for solving…
Efficient control schemes that enable fast, high-fidelity operations are essential for any practical quantum computation. However, current optimization protocols are intractable due to stringent requirements imposed by the microscopic…
We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with $\mathcal{O}(\kappa~\text{poly}(\log(\kappa/\epsilon)))$ runtime, where…
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated…