This paper reviews quantum machine learning from NISQ to fault tolerance.
problem The challenges and opportunities in quantum machine learning.
method Comprehensive review of quantum machine learning concepts.
result Coverage of NISQ and fault-tolerant quantum computing approaches.
We introduce a differential geometric framework for describing families of quantum error-correcting codes and for understanding quantum fault tolerance. This work unifies the notion of topological fault tolerance with fault tolerance in other kinds of quantum error-correcting codes. In particular, we use fibre bundles …
Quantum computers outperform classical methods in density modeling.
problem Density modeling with quantum computers.
method Quantum-classical separation for density modeling.
result Quantum computers offer a super-polynomial advantage over classical algorithms for density modeling.
Quantum models are rephrased as kernel methods, improving performance.
problem Improving quantum machine learning models by encoding data into quantum states.
method Rephrasing quantum models as kernel methods and using support vector machines.
result Kernel-based training finds better quantum models than variational circuit training.
Quantum GAN improves volatility modeling in finance.
problem Improving volatility modeling in finance using GANs.
method Developed a quantum GAN for volatility modeling.
result Quantum GAN provides exponential advantage over classical methods.
Quantum computing poses a threat to Bitcoin and Ethereum, but only to spending and not mining.
problem Quantum computing threat to Bitcoin and Ethereum
method Separation of Shor's and Grover's quantum algorithms
result Quantum algorithms' impact on Bitcoin and Ethereum
GKP codes connect quantum gates to algebraic curves, enabling fault-tolerant quantum computation.
problem Implementing fault-tolerant quantum computation in quantum harmonic oscillator systems.
method Exploring the topological and algebraic structure of GKP codes, showing how gates correspond to symplectic automorphisms and mapping class groups of surfaces.
result GKP Clifford gates are identified with symplectic automorphisms of GKP lattices and mapping class groups of surfaces, providing a topological interpretation of fault tolerance.
Quantum advantage in derivative pricing requires 8k qubits and 54M T-depth.
problem Quantum advantage in pricing derivatives.
method Re-parameterization method combining pre-trained variational circuits and fault-tolerant quantum computing.
result Benchmark use cases require 8k logical qubits and a T-depth of 54 million.
New fault-tolerant quantum gates for homological LDPC codes with constant or almost-constant rate.
problem Fault-tolerant quantum computing for homological LDPC codes with constant or almost-constant encoding rate.
method Derive generic formula for transversal and logical gates acting on 3-manifolds, using higher symmetries and cup product cohomology.
result Parallelizable logical gates for homological LDPC codes with constant or almost-constant rate.
VQAs use classical optimization to train quantum circuits, promising quantum advantage.
problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.
Finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in fault-tolerant devices represents a significant challenge. In this paper we introduce several decoding algorithms complemented by deep neural decoders and apply them to analyze several fault-tolerant error correctio…
Fault-tolerant neural networks inspired by biological error correction codes.
problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.
A basic question in the theory of fault-tolerant quantum computation is to understand the fundamental resource costs for performing a universal logical set of gates on encoded qubits to arbitrary accuracy. Here we consider qubits encoded with constant space overhead (i.e. finite encoding rate) in the limit of arbitrari…
Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.
problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.
Quantum model discovery uses DQCs to solve equations from data.
problem Discovering differential equations from data using quantum computing.
method Differentiable quantum circuits (DQCs) to solve parameterized equations, regression on data and equations.
result Successful parameter inference and equation discovery on various systems.
Quantum computing offers new solutions for financial optimization, pricing, risk, and security.
problem Core financial bottlenecks in combinatorial search, expectation estimation, and rare-event analysis.
method Identify bottlenecks, specify quantum primitives, compare with classical benchmarks, assess under constraints.
result Strongest near-term case for quantum finance in hybrid workflows, constrained search, and amplitude-estimation.
Improves VQAs by balancing classical and quantum training resources.
problem Challenges in trainability and resource costs of VQAs on quantum hardware.
method Adopting HELIA Ansatz and combining classical and quantum methods for gradient estimation and training.
result Achieves higher accuracy and success rates in VQE and improved test accuracy in quantum phase classification.
Quantum algorithm solves financial option pricing using Hamiltonian simulation.
problem Efficiently solving the Black-Scholes equation for option pricing dynamics.
method Mapped Black-Scholes equation to Schrödinger equation, used efficient Hamiltonian simulation techniques.
result Quantum algorithm shows feasible approach for solving financial derivatives on a quantum computer.
Topological theory for qLDPC codes enables non-Clifford gates and magic state injection.
problem Fault-tolerant quantum computation in qLDPC codes with non-Clifford gates and magic state resources.
method Developed a topological theory using simplicial or CW complex structures and deformation retraction.
result Achieved non-Clifford gates and magic state injection in qLDPC codes with constant rate and polynomial distance.
Develops an analytic theory for quantum imaginary time evolution.
problem Lack of a first-principle understanding of quantum imaginary time evolution.
method Interprets QITE as a form of VQA trained with QNGD and connects it to the geometric geodesic distance in the quantum Fisher information metric.
result QITE converges faster than vanilla gradient descent-based VQAs, though the advantage is suppressed by Hilbert space dimensionality.
We classify all unitary modular tensor categories (UMTCs) of rank ≤4. There are a total of 70 UMTCs of rank ≤4 (Note that some authors would have counted as 35 MTCs.) In our convention there are two trivial unitary MTCs distinguished by the modular S matrix S=(±1). Each such UMTC can be obtained from …
The loss of a few neurons in a brain rarely results in any visible loss of function. However, the insight into what "few" means in this context is unclear. How many random neuron failures will it take to lead to a visible loss of function? In this paper, we address the fundamental question of the impact of the crash of…
Paper addresses fault-tolerance in distributed machine learning with stochastic gradient descent.
problem Fault-tolerance in distributed stochastic gradient descent (D-SGD) for machine learning.
method Proposes norm-based comparative gradient elimination (CGE) to robustify D-SGD against Byzantine faulty agents.
result CGE guarantees fault-tolerance against a bounded fraction of Byzantine agents under standard stochastic assumptions.
Paper proposes FTT-NAS to create fault-tolerant CNNs for edge devices.
problem Faults in edge devices affect deep learning applications.
method Formalized fault models, implemented FTT-NAS, incorporated FTT.
result Discovered CNNs outperform baseline architectures with fault tolerance.
Machine learning (ML) training algorithms often possess an inherent self-correcting behavior due to their iterative-convergent nature. Recent systems exploit this property to achieve adaptability and efficiency in unreliable computing environments by relaxing the consistency of execution and allowing calculation errors…
We analyze the adversarial examples problem in terms of a model's fault tolerance with respect to its input. Whereas previous work focuses on arbitrarily strict threat models, i.e., ε-perturbations, we consider arbitrary valid inputs and propose an information-based characteristic for evaluating tolerance to diverse …
Deep Learning Accelerators are prone to faults which manifest in the form of errors in Neural Networks. Fault Tolerance in Neural Networks is crucial in real-time safety critical applications requiring computation for long durations. Neural Networks with high regularisation exhibit superior fault tolerance, however, at…
New quantum code breaks distance barrier with transversal non-Clifford gates.
problem Breaking the sqrt(N) distance barrier for quantum LDPC codes.
method Combining three qLDPC codes, Freedman-Hastings mapping, and triple cup product.
result Achieves Ω(N^(2/3)) distance and Θ(N^(2/3)) dimension, enabling fault-tolerant magic state preparation.
SignSGD improves distributed learning by tolerating faulty devices, including Byzantine adversaries.
problem Faulty devices, including Byzantine adversaries, disrupt convergence in distributed learning.
method Developed SignSGD from SGD, proving its robustness to Byzantine adversaries with upper bound convergence rate.
result SignSGD converges in the presence of Byzantine adversaries, providing a fault-tolerant solution.
Training machine learning (ML) models on large datasets requires considerable computing power. To speed up training, it is typical to distribute training across several machines, often with specialized hardware like GPUs or TPUs. Managing a distributed training job is complex and requires dealing with resource contenti…
This paper considers the problem of Byzantine fault tolerance in distributed linear regression in a multi-agent system. However, the proposed algorithms are given for a more general class of distributed optimization problems, of which distributed linear regression is a special case. The system comprises of a server and…
Neural Networks (NN) have recently emerged as backbone of several sensitive applications like automobile, medical image, security, etc. NNs inherently offer Partial Fault Tolerance (PFT) in their architecture; however, the biased PFT of NNs can lead to severe consequences in applications like cryptography and security …
Quantum computing speeds up multi-period asset allocation.
problem High computational complexity in classic computing for multi-period asset allocation.
method Applied quantum computing to simulate multi-asset portfolio using historic data.
result Quantum computing offers significant advantages over classical computing in finance.
Survey on quantum computing and neural networks.
problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.
Quantum machine learning tackles large datasets with randomized measurements.
problem Efficiently process large, high-dimensional datasets on quantum computers.
method Randomized measurements to scale linearly with dataset size and quadratic for post-processing.
result Substantial speed-up for noisy quantum computers, enabling image classification.
Quantum computing techniques improve graph analysis and community detection.
problem Analyzing large graphs efficiently and accurately.
method Used quantum annealing and quantum gate computers for community detection and regularity checking.
result Demonstrated the effectiveness of quantum computing in solving complex graph problems.
Quantum computing offers new solutions for finance problems.
problem Challenging classical computational problems in finance.
method Quantum algorithms for finance applications.
result Potential benefits for financial services.
Quantum computers can optimize foreign exchange reserves management.
problem Optimizing foreign exchange reserves management using quantum computing.
method Demonstrated through quantum Monte Carlo risk measurement and quantum algorithms for portfolio optimization.
result Quantum computers can theoretically optimize FX reserves management in the future.
Quantum reservoir computing improves volatility forecasting.
problem Forecasting realized volatility in finance.
method Quantum reservoir computing with Ising Hamiltonian and feature selection.
result Quantum reservoir computing outperforms benchmarks in volatility forecasting.
QBC uses quantum computers to speed up Bayesian computation.
problem Exponential speed-up in Bayesian computation.
method Quantum von Neumann measurement for simulating ML algorithms.
result Quantum versions of regression, Gaussian processes, and SGD.
Quantum computing aids in optimizing currency reserves for central banks.
problem Optimizing currency composition in foreign exchange reserves.
method Comparison of quantum and classical algorithms for portfolio optimization.
result Quantum algorithms outperform classical methods in currency optimization.
Quantum machine learning model for binary classification.
problem Efficiency in high-dimensional binary classification tasks.
method Quantum-classical hybrid algorithm and quantum computer for inference.
result Quantum discriminator achieves 99% accuracy on Iris dataset.
Quantum computing promises faster finance algorithms.
problem Solving finance problems faster than classical methods.
method Quantum computing applications to finance, including Monte Carlo, portfolio optimization, and machine learning.
result Quantum speedups for finance problems, especially Monte Carlo and portfolio optimization.
This review covers quantum computing applications in finance and blockchain.
problem Challenges in finance and blockchain security with quantum computing.
method Systematic review of recent quantum finance and blockchain work.
result Quantum-resistant blockchain systems and security measures.
Quantum walk algorithm optimizes quantum state preparation for financial simulations.
problem Efficiently loading classical data into quantum states for quantum computers.
method Split-step quantum walks (SSQW) to design parameterized quantum circuits (PQC).
result SSQW facilitates generating desired probability amplitude distributions for quantum simulations.
Quantum computing promises new financial modeling.
problem Traditional financial modeling limitations.
method Overview of quantum computing applications in finance.
result Quantum computing can enhance financial modeling.
The combination of machine learning and quantum computing has emerged as a promising approach for addressing previously untenable problems. Reservoir computing is an efficient learning paradigm that utilizes nonlinear dynamical systems for temporal information processing, i.e., processing of input sequences to produce …
Quantum computing promises faster bioinformatics, but challenges remain.
problem Efficient bioinformatics processing and drug discovery.
method Quantum algorithms for optimization, simulation, and machine learning.
result Quantum computing can significantly speed up bioinformatics tasks.