Related papers: Reversible Computing with Fast, Fully Static, Full…
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…
The commercialization of transistors capable of both switching and amplification in 1960 resulted in the development of second-generation computers, which resulted in the miniaturization and lightening while accelerating the reduction and…
Adiabatic passage is a standard tool for achieving robust transfer in quantum systems. We show that, in the context of driven nonlinear Hamiltonian systems, adiabatic passage becomes highly non-robust when the target is unstable. We show…
Current computers operate at enormous speeds of ~10^13 bits/s, but their principle of sequential logic operation has remained unchanged since the 1950s. Though our brain is much slower on a per-neuron base (~10^3 firings/s), it is capable…
Reversible computation has been proposed as a future paradigm for energy efficient computation, but so far few implementations have been realised in practice. Quantum circuits, running on quantum computers, are one construct known to be…
Reversible logic has become one of the promising research directions in low power dissipating circuit design in the past few years and has found its applications in low power CMOS design, cryptography, optical information processing and…
We develop new protocols for high-fidelity single qubit gates that exploit and extend theoretical ideas for accelerated adiabatic evolution. Our protocols are compatible with qubit architectures with highly isolated logical states, where…
Duplication-based redundancy schemes have proven to be effective in designing fully-resilient Quasi-delay Insensitive (QDI) asynchronous circuits. The complete resiliency, however, is accompanied by significant energy, latency, and area…
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…
The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous…
Recent advances in logic schemes and fabrication processes have renewed interest in using superconductor electronics for energy-efficient computing and quantum control processors. However, scalable superconducting memory still poses a…
Adiabatic Quantum Computing (AQC) is a relatively new subject in the world of quantum computing, let alone Physics. Inspiration for this project has come from recent controversy around D-Wave Systems in British Columbia, Canada, who claim…
Adiabatic evolutions find widespread utility in applications to quantum state engineering, geometric quantum computation, and quantum simulation. Although offering robustness to experimental imperfections, adiabatic processes are…
Adiabatic evolution is used in a variety of quantum information processing tasks. However, the elimination of errors is not as well-developed as it is for circuit model processing. Here, we present a strategy to accelerate a reliable…
Shortcuts to adiabaticity (STA) are fast methods to realize the same final state evolution of quantum adiabatic process. We develop a general theory to construct a new kind of STA by solely sampling the points of the adiabatic path of the…
Models of sensory processing and learning in the cortex need to efficiently assign credit to synapses in all areas. In deep learning, a known solution is error backpropagation, which however requires biologically implausible weight…
Low power design has become one of the most significant requirements when CMOS technology entered the nanometer era. Therefore, timing budget is often performed to slow down as many components as possible so that timing slacks can be…
In the pursuit of scalable superconducting quantum computing, tunable couplers have emerged as a pivotal component, offering the flexibility required for complex quantum operations of high performance. In most current architectures of…
Linear system solvers are widely used in scientific computing, with the primary goal of solving linear system problems. Classical iterative algorithms typically rely on the conjugate gradient method. The rise of quantum computing has…
Recent advancements in slow thinking reasoning models have shown exceptional performance in complex reasoning tasks. However, these models often exhibit overthinking (generating redundant reasoning steps for simple problems), leading to…