Related papers: Hierarchical Fusion Method for Scalable Quantum Ei…
Fractional quantum Hall systems are among the most exciting strongly correlated systems. Accessing them microscopically via quantum simulations with ultracold atoms would be an important achievement toward a better understanding of this…
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…
Stochastic simulation methods can be applied successfully to model exact spatio-temporally resolved reaction-diffusion systems. However, in many cases, these methods can quickly become extremely computationally intensive with increasing…
The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made to mimic an adiabatic schedule, and in the $p\to\infty$ limit the…
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…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
In a recent study (Ref. [1]), quantum annealing was reported to exhibit a scaling advantage for approximately solving Quadratic Unconstrained Binary Optimization (QUBO). However, this claim critically depends on the choice of classical…
We propose a quantum algorithm based on ridge regression model, which get the optimal fitting parameters w and a regularization hyperparameter {\alpha} by analysing the training dataset. The algorithm consists of two subalgorithms. One is…
Integer factorization remains a significant challenge for classical computers and is fundamental to the security of RSA encryption. Adiabatic quantum algorithms present a promising solution, yet their practical implementation is limited by…
Within the present noisy intermediate-scale quantum-computing era, hybrid quantum-classical-processor algorithms have emerged as promising avenues for tackling electronic-structure eigenproblems. Among them, the so-called…
We propose the implementation of a rapid adiabatic passage (RAP) scheme to generate entanglement in Rydberg atom-array systems. This method transforms a product state in a multi-qubit system into an entangled state with high fidelity and…
We combine quantum optimal control with a variational ansatz based on non-Gaussian states for fast, non-adiabatic preparation of quantum many-body states. We demonstrate this on the example of the spin-boson model, and use a multi-polaron…
Accurate population transfer of uncoupled or weakly coupled spin states is crucial for many quantum information processing tasks. In this paper, we propose a fast and robust scheme for population transfer which combines invariant-based…
We use the invariant-based inverse engineering subject to the quasiadiabatic condition to produce robust and high fidelity coherent superposition of quantum states. The inverse engineering provides shortcuts to the desired quantum-state…
Establishing quantum speedup for computationally hard problems of practical relevance, particularly combinatorial optimization problems, remains a central challenge in quantum computation. In this work, we identify a structurally defined…
Practical applicability of quantum optimisation on near term devices is constrained by limited qubit counts and hardware noise, which restricts the scalability of quantum optimisation algorithms for combinatorial problems. The simulation of…
RNAs self-interact through hydrogen-bond base-pairing between nucleotides and fold into specific, stable structures that substantially govern their biochemical behaviour. Experimental characterization of these structures remains difficult,…
Spin-squeezed states are metrologically useful quantum states where entanglement allows for enhanced sensing with respect to the standard quantum limit. Key challenges include the efficient preparation of spin-squeezed states and the…
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate optimization algorithm (QAOA). These algorithms are…
In many quantum technologies adiabatic processes are used for coherent quantum state operations, offering inherent robustness to errors in the control parameters. The main limitation is the long operation time resulting from the requirement…