Exponential Speedup Research Articles

Nonlinear transformation of complex amplitudes via quantum singular value transformation

Due to the linearity of quantum operations, it is not straightforward to implement nonlinear transformations on a quantum computer, making some practical tasks like a neural network hard to achieve. In this paper, we define a task called and provide an algorithm to achieve this task. Specifically, we construct a block encoding of complex amplitudes from a state preparation unitary. This allows us to transform the complex amplitudes by using quantum singular value transformation. We evaluate the required overhead in terms of input dimension and precision, which reveals that the algorithm depends on the roughly square root of input dimension and achieves an exponential speedup on precision compared with previous work. We also discuss its possible applications to quantum machine learning, where complex amplitudes encoding classical or quantum data are processed by the proposed method. In this paper, we provide a promising way to introduce the highly complex nonlinearity of the quantum states, which is essentially missing in quantum mechanics. Published by the American Physical Society 2024

Near-optimal quantum kernel principal component analysis

Abstract Kernel principal component analysis (kernel PCA) is a nonlinear dimensionality reduction technique that employs kernel functions to map data into a high-dimensional feature space, thereby extending the applicability of linear PCA to nonlinear data and facilitating the extraction of informative principal components. However, kernel PCA necessitates the manipulation of large-scale matrices, leading to high computational complexity and posing challenges for efficient implementation in big data environments. Quantum computing has recently been integrated with kernel methods in machine learning, enabling effective analysis of input data within intractable feature spaces. Although existing quantum kernel PCA proposals promise exponential speedups, they impose stringent requirements on quantum hardware that are challenging to fulfill. In this work, we propose a quantum algorithm for kernel PCA by establishing a connection between quantum kernel methods and block encoding, thereby diagonalizing the centralized kernel matrix on a quantum computer. The query complexity is logarithmic with respect to the size of the data vector, $D$, and linear with respect to the size of the dataset. An exponential speedup could be achieved when the dataset consists of a few high-dimensional vectors, wherein the dataset size is polynomial in $\log(D)$, with $D$ being significantly large. In contrast to existing work, our algorithm enhances the efficiency of quantum kernel PCA and reduces the requirements for quantum hardware. Furthermore, we have also demonstrated that the algorithm based on block encoding matches the lower bound of query complexity, indicating that our algorithm is nearly optimal. Our research has laid down new pathways for developing quantum machine learning algorithms aimed at addressing tangible real-world problems and demonstrating quantum advantages within machine learning.

Exploration and Development of Quantum Computing Algorithms for Optimization, Cryptography, and Machine Learning Applications

Quantum computing, with its potential to revolutionize computation, relies fundamentally on the development of efficient algorithms to leverage its unparalleled processing capabilities. This research delves into the creation, exploration, and refinement of quantum computing algorithms, focusing on their applications in optimization, cryptography, and machine learning. Quantum algorithms such as Shor's and Grover's have demonstrated remarkable advantages in factorization and search problems, while more recent innovations are tackling complex challenges in global optimization and data analysis. By integrating principles of quantum mechanics—such as superposition, entanglement, and interference—these algorithms promise exponential speed-ups over classical counterparts in specific domains. This study critically analyzes existing quantum algorithms, proposes advancements in hybrid quantum-classical frameworks, and explores their implications for practical problem-solving. Through simulations and theoretical evaluations, it aims to bridge the gap between quantum theory and real-world applications, contributing to the evolution of quantum computing as a transformative technology.

Scalable O(log2n) Dynamics Control for Soft Exoskeletons

Robotic exoskeletons are being actively applied to support the activities of daily living (ADL) for patients with hand motion impairments. In terms of actuation, soft materials and sensors have opened new alternatives to conventional rigid body structures. In this arena, biomimetic soft systems play an important role in modeling and controlling human hand kinematics without the restrictions of rigid mechanical joints while having an entirely deformable body with limitless points of actuation. In this paper, we address the computational limitations of modeling large-scale articulated systems for soft robotic exoskeletons by integrating a parallel algorithm to compute the exoskeleton’s dynamics equations of motion (EoM), achieving a computation with O(log2n) complexity for the highly articulated n degrees of freedom (DoF) running on p processing cores. The proposed parallel algorithm achieves an exponential speedup for n=p=64 DoF while achieving a 0.96 degree of parallelism for n=p=256, which demonstrates the required scalability for controlling highly articulated soft exoskeletons in real time. However, scalability will be bounded by the n=p fraction.

Quantum Machine Learning-Quo Vadis?

The book Quantum Machine Learning: What Quantum Computing Means to Data Mining, by Peter Wittek, made quantum machine learning popular to a wider audience. The promise of quantum machine learning for big data is that it will lead to new applications due to the exponential speed-up and the possibility of compressed data representation. However, can we really apply quantum machine learning for real-world applications? What are the advantages of quantum machine learning algorithms in addition to some proposed artificial problems? Is the promised exponential or quadratic speed-up realistic, assuming that real quantum computers exist? Quantum machine learning is based on statistical machine learning. We cannot port the classical algorithms directly into quantum algorithms due to quantum physical constraints, like the input-output problem or the normalized representation of vectors. Theoretical speed-ups of quantum machine learning are usually analyzed in the literature by ignoring the input destruction problem, which is the main bottleneck for data encoding. The dilemma results from the following question: should we ignore or marginalize those constraints or not?

Quantum algorithm for dynamic mode decomposition integrated with a quantum differential equation solver

We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of a dynamic mode decomposition algorithm used in diverse fields such as fluid dynamics, molecular dynamics, and epidemiology. Our quantum algorithm can also compute matrix eigenvalues and eigenvectors by analyzing the corresponding linear dynamical system. Our algorithm handles a broad range of matrices, particularly those with complex eigenvalues. The complexity of our quantum algorithm is O(polylogN) for an N-dimensional system. This is an exponential speedup over known classical algorithms with at least O(N) complexity. Thus, our quantum algorithm is expected to enable high-dimensional dynamical systems analysis and large matrix eigenvalue decomposition, intractable for classical computers. Published by the American Physical Society 2024

Thermodynamics of the Quantum Mpemba Effect.

We investigate the quantum Mpemba effect from the perspective of nonequilibrium quantum thermodynamics by studying relaxation dynamics of quantum systems coupled to a Markovian heat bath, which are described by Davies maps. Starting from a state with coherences in the energy eigenbasis, we demonstrate that an exponential speedup to equilibrium will always occur if the state is transformed to a diagonal state in the energy eigenbasis, provided that the spectral gap of the generator is defined by a complex eigenvalue. When the transformed state has a higher nonequilibrium free energy, we argue using thermodynamic reasoning that this is a genuine quantum Mpemba effect. Furthermore, we show how a unitary transformation on an initial state can always be constructed to yield the effect and demonstrate our findings by studying the dynamics of both the nonequilibrium free energy and the irreversible entropy production in single and multiqubit examples.

Quantum Tensor DBMS and Quantum Gantt Charts: Towards Exponentially Faster Earth Data Engineering

Earth data is essential for global environmental studies. Many Earth data types are naturally modeled by multidimensional arrays (tensors). Array (Tensor) DBMSs strive to be the best systems for tensor-related workloads and can be especially helpful for Earth data engineering, which takes up to 80% of Earth data science. We present a new quantum Array (Tensor) DBMS data model and new quantum approaches that rely on the upcoming quantum memory and demonstrate exponential speedups when applied to many toughest Array (Tensor) DBMS challenges stipulated by classical computing and real-world Earth data use-cases. We also propose new types of charts: Quantum Gantt (QGantt) Charts and Quantum Network Diagrams (QND). QGantt charts clearly illustrate how multiple operations occur simultaneously across different data items and what are the input/output data dependencies between these operations. Unlike traditional Gantt charts, which typically track project timelines and resources, QGantt charts integrate specific data items and operations over time. A Quantum Network Diagram combines several QGantt charts to show dependencies between multistage operations, including their inputs/outputs. By using a static format, QGantt charts and Quantum Network Diagrams allow users to explore complex processes at their own pace, which can be beneficial for educational and R&D purposes.

Exponentially faster preparation of quantum dimers via driven-dissipative stabilization

We propose a rapid, high-fidelity, and noise-resistant scheme to generate many-body entanglement between multiple qubits stabilized by dissipation into a 1D bath. Using a carefully designed time-dependent drive, our scheme achieves a provably exponential speedup over state-of-the-art dissipative stabilization schemes in 1D baths, which require a timescale that diverges as the target fidelity approaches unity and scales exponentially with the number of qubits. To prepare quantum dimer pairs, our scheme only requires local 2-qubit control Hamiltonians, with a protocol time that is independent of system size. This provides a scalable and robust protocol for generating a large number of entangled dimer pairs on-demand, serving as a fundamental resource for many quantum metrology and quantum information processing tasks. Published by the American Physical Society 2024

Chaotic roots of the modular multiplication dynamical system in Shor's algorithm

Shor's factoring algorithm, believed to provide an exponential speedup over classical computation, relies on finding the period of an exactly periodic quantum modular multiplication operator. This exact periodicity is the hallmark of an integrable system, which is paradoxical from the viewpoint of quantum chaos, given that the classical limit of the modular multiplication operator is a highly chaotic system that occupies the “maximally random” Bernoulli level of the classical ergodic hierarchy. In this work, we approach this apparent paradox from a quantum dynamical systems viewpoint, and consider whether signatures of ergodicity and chaos may indeed be encoded in such an “integrable” quantization of a chaotic system. We show that Shor's modular multiplication operator, in specific cases, can be written as a superposition of quantized A-baker's maps exhibiting more typical signatures of quantum chaos and ergodicity. This work suggests that the integrability of Shor's modular multiplication operator may stem from the interference of other “chaotic” quantizations of the same family of maps, and paves the way for deeper studies on the interplay of integrability, ergodicity, and chaos in and via quantum algorithms. Published by the American Physical Society 2024

Advancements in quantum image filtering: Exponential speedup on a subset of images

Advancements in quantum image filtering: Exponential speedup on a subset of images

Quantum Computing for High-Energy Physics: State of the Art and Challenges

Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage—namely, a significant (in some cases exponential) speedup of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small-scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models that are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this Roadmap paper, led by CERN, DESY, and IBM, we provide the status of high-energy physics quantum computations and give examples of theoretical and experimental target benchmark applications, which can be addressed in the near future. Having in mind hardware with about 100 qubits capable of executing several thousand two-qubit gates, where possible, we also provide resource estimates for the examples given using error-mitigated quantum computing. The ultimate declared goal of this task force is therefore to trigger further research in the high-energy physics community to develop interesting use cases for demonstrations on near-term quantum computers. Published by the American Physical Society 2024

Enhanced QSimon Algorithm for Attacking the Offset Two‐Round Scheme

AbstractQSimon algorithm (a full quantum version of Simon's algorithm) is used to find periods in commitment functions and does not require classical calculations. However, QSimon algorithm circuit is incomplete, and the implementation of an essential component (solving boolean linear equations) has high resource consumption. This work further studies QSimon algorithm and applies QSimon algorithm to attack the offset two‐round (OTR) scheme. QSimon algorithm is established by quantum boolean linear equations solving algorithm and general quantum truncation technique, which can obtain the period of any truncated function with overwhelming probability. The confidentiality and integrity of the OTR scheme are compromised by employing QSimon algorithm. The attacks ensure a high success rate and realize exponential speedup compared with classical versions.

Exponentially tighter bounds on limitations of quantum error mitigation

Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing without the heavy resource overheads required by fault-tolerant schemes. Recently, error mitigation has been successfully applied to reduce noise in near-term applications. In this work, however, we identify strong limitations to the degree to which quantum noise can be effectively ‘undone’ for larger system sizes. Our framework rigorously captures large classes of error-mitigation schemes in use today. By relating error mitigation to a statistical inference problem, we show that even at shallow circuit depths comparable to those of current experiments, a superpolynomial number of samples is needed in the worst case to estimate the expectation values of noiseless observables, the principal task of error mitigation. Notably, our construction implies that scrambling due to noise can kick in at exponentially smaller depths than previously thought. Noise also impacts other near-term applications by constraining kernel estimation in quantum machine learning, causing an earlier emergence of noise-induced barren plateaus in variational quantum algorithms and ruling out exponential quantum speed-ups in estimating expectation values in the presence of noise or preparing the ground state of a Hamiltonian.

Polylogarithmic-depth controlled-NOT gates without ancilla qubits

Controlled operations are fundamental building blocks of quantum algorithms. Decomposing n-control-NOT gates (Cn(X)) into arbitrary single-qubit and CNOT gates, is a crucial but non-trivial task. This study introduces Cn(X) circuits outperforming previous methods in the asymptotic and non-asymptotic regimes. Three distinct decompositions are presented: an exact one using one borrowed ancilla with a circuit depth Θ(log(n)3)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Theta (\\log {(n)}^{3})$$\\end{document}, an approximating one without ancilla qubits with a circuit depth O(log(n)3log(1/ϵ))\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${{{{{{{\\mathcal{O}}}}}}}}(\\log {(n)}^{3}\\log (1/\\epsilon ))$$\\end{document} and an exact one with an adjustable-depth circuit which decreases with the number m≤n of ancilla qubits available as O(log(n/⌊m/2⌋)3+log(⌊m/2⌋))\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${{{{{{{\\mathcal{O}}}}}}}}(\\log {(n/\\lfloor m/2\\rfloor )}^{3}+\\log (\\lfloor m/2\\rfloor ))$$\\end{document}. The resulting exponential speedup is likely to have a substantial impact on fault-tolerant quantum computing by improving the complexities of countless quantum algorithms with applications ranging from quantum chemistry to physics, finance and quantum machine learning.

The quantum transition of the two-dimensional Ising spin glass

Quantum annealers are commercial devices that aim to solve very hard computational problems1, typically those involving spin glasses2,3. Just as in metallurgic annealing, in which a ferrous metal is slowly cooled4, quantum annealers seek good solutions by slowly removing the transverse magnetic field at the lowest possible temperature. Removing the field diminishes the quantum fluctuations but forces the system to traverse the critical point that separates the disordered phase (at large fields) from the spin-glass phase (at small fields). A full understanding of this phase transition is still missing. A debated, crucial question regards the closing of the energy gap separating the ground state from the first excited state. All hopes of achieving an exponential speed-up, compared to classical computers, rest on the assumption that the gap will close algebraically with the number of spins5–9. However, renormalization group calculations predict instead that there is an infinite-randomness fixed point10. Here we solve this debate through extreme-scale numerical simulations, finding that both parties have grasped parts of the truth. Although the closing of the gap at the critical point is indeed super-algebraic, it remains algebraic if one restricts the symmetry of possible excitations. As this symmetry restriction is experimentally achievable (at least nominally), there is still hope for the quantum annealing paradigm11–13.

Quantum Computing in Artificial Intelligence: A Paradigm Shift

Quantum computing and artificial intelligence (AI) are two of the most transformative technologies of the 21st century. The convergence of these fields promises unprecedented advancements in computational capabilities, enabling solutions to complex problems that are currently intractable for classical computers. This paper explores the intersection of quantum computing and AI, examining the potential impacts, current research, challenges, and future directions. By leveraging quantum phenomena such as superposition, entanglement, and quantum parallelism, quantum computing can enhance AI algorithms, offering exponential speedups and new methodologies for machine learning, optimization, and data analysis.

On quantum computing for artificial superintelligence

Artificial intelligence algorithms, fueled by continuous technological development and increased computing power, have proven effective across a variety of tasks. Concurrently, quantum computers have shown promise in solving problems beyond the reach of classical computers. These advancements have contributed to a misconception that quantum computers enable hypercomputation, sparking speculation about quantum supremacy leading to an intelligence explosion and the creation of superintelligent agents. We challenge this notion, arguing that current evidence does not support the idea that quantum technologies enable hypercomputation. Fundamental limitations on information storage within finite spaces and the accessibility of information from quantum states constrain quantum computers from surpassing the Turing computing barrier. While quantum technologies may offer exponential speed-ups in specific computing cases, there is insufficient evidence to suggest that focusing solely on quantum-related problems will lead to technological singularity and the emergence of superintelligence. Subsequently, there is no premise suggesting that general intelligence depends on quantum effects or that accelerating existing algorithms through quantum means will replicate true intelligence. We propose that if superintelligence is to be achieved, it will not be solely through quantum technologies. Instead, the attainment of superintelligence remains a conceptual challenge that humanity has yet to overcome, with quantum technologies showing no clear path toward its resolution.

A quantum computing concept for 1-D elastic wave simulation with exponential speedup

SUMMARY Quantum computing has attracted considerable attention in recent years because it promises speedups that conventional supercomputers cannot offer, at least for some applications. Though existing quantum computers (QCs) are, in most cases, still too small to solve significant problems, their future impact on domain sciences is already being explored now. Within this context, we present a quantum computing concept for 1-D elastic wave propagation in heterogeneous media with two components: a theoretical formulation and an implementation on a real QC. The method rests on a finite-difference approximation, followed by a sparsity-preserving transformation of the discrete elastic wave equation to a Schrödinger equation, which can be simulated directly on a gate-based QC. An implementation on an error-free quantum simulator verifies our approach and forms the basis of numerical experiments with small problems on the real QC IBM Brisbane. The latter produce simulation results that qualitatively agree with the error-free version but are contaminated by quantum decoherence and noise effects. Complementing the discrete transformation to the Schrödinger equation by a continuous version allows the replacement of finite differences by other spatial discretization schemes, such as the spectral-element method. Anticipating the emergence of error-corrected quantum chips, we analyse the computational complexity of the best quantum simulation algorithms for future QCs. This analysis suggests that our quantum computing approach may lead to wavefield simulations that run exponentially faster than simulations on classical computers.

A pragma based C++ framework for hybrid quantum/classical computation

Quantum computers promise exponential speed ups over classical computers for various tasks. This emerging technology is expected to have its first huge impact in High Performance Computing (HPC), as it can solve problems beyond the reach of HPC. To that end, HPC will require quantum accelerators, which will enable applications to run on both classical and quantum devices, via hybrid quantum-classical nodes. Hybrid quantum-HPC applications should be scalable, executable on Quantum Error Corrected (QEC) devices, and could use quantum-classical primitives. However, the lack of scalability, poor performances, and inability to insert classical schemes within quantum applications has prevented current quantum frameworks from being adopted by the HPC community.This paper specifies the requirements of a hybrid quantum-classical framework compatible with HPC environments, and introduces a novel hardware-agnostic framework called Q-Pragma. This framework extends the classical programming language C++ heavily used in HPC via the addition of pragma directives to manage quantum computations.