Related papers: The Quantum Steeplechase
Quadratically constrained quadratic programs (QCQPs) have a wide range of applications in signal processing and wireless communications. Non-convex QCQPs are NP-hard in general. Existing approaches relax the non-convexity using…
Biclustering is a powerful approach to search for patterns in data, as it can be driven by a function that measures the quality of diverse types of patterns of interest. However, due to its computational complexity, the exploration of the…
We investigate the excitation dynamics at a first-order quantum phase transition (QPT). More specifically, we consider the quench-induced QPT in the quantum search algorithm, which aims at finding out a marked element in an unstructured…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
Single-shot readout is a key component for scalable quantum information processing. However, many solid-state qubits with favorable properties lack the single-shot readout capability. One solution is to use the repetitive…
Post-training quantization (PTQ) has emerged as a critical technique for efficient deployment of large language models (LLMs). This work proposes NestQuant, a novel PTQ scheme for weights and activations that is based on self-similar nested…
Variational algorithms have particular relevance for near-term quantum computers but require non-trivial parameter optimisations. Here we propose Analytic Descent: Given that the energy landscape must have a certain simple form in the local…
Quantization based techniques are the current state-of-the-art for scaling maximum inner product search to massive databases. Traditional approaches to quantization aim to minimize the reconstruction error of the database points. Based on…
Nested Sampling is a method for computing the Bayesian evidence, also called the marginal likelihood, which is the integral of the likelihood with respect to the prior. More generally, it is a numerical probabilistic quadrature rule. The…
Quantum phase transitions (QPTs) are investigated in biquadratic spin-$1$ XY chain with rhombic single-ion anisotropy by using the ground state energy (GE), the bipartite entanglement entropy (BEE), and the mutual information (MI). It turns…
A particular quantum phase transition (QPT) is studied at excited energies of light nuclei within the Semimicroscopic Algebraic Cluster Model (SACM), using a combination of catastrophe theory and a direct minimization of the potential. A…
Quantum entanglement is known as a unique quantum feature that cannot be obtained by classical physics. Over the last several decades, however, such an understanding on quantum entanglement might have confined us in a limited world of weird…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
During recent years there has been an increased interest in stochastic adaptations of limited memory quasi-Newton methods, which compared to pure gradient-based routines can improve the convergence by incorporating second order information.…
This article is an introduction to two currently very active research programs, the Conformal Bootstrap and Scattering Amplitudes. Rather than attempting full surveys, the emphasis is on common ideas and methods shared by these two…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…
The lackadaisical quantum walk, which is a quantum walk with a weighted self-loop at each vertex, has been shown to speed up dispersion on the line and improve spatial search on the complete graph and periodic square lattice. In these…
Quantum entanglement and quantum nonstabilizerness are fundamental resources that characterize distinct aspects of a quantum state: entanglement reflects non-local correlations, while nonstabilizerness quantifies the deviation from…
Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the solution, but small convergence domain. On the other hand…
The original Grover's algorithm suffers from the souffle problem, which means that the success probability of quantum search decreases dramatically if the iteration time is too small or too large from the right time. To overcome the souffle…