In quantum computation, series of quantum gates have to be arranged in a predefined sequence that led to a quantum circuit in order to solve a particular problem. What if the sequence of quantum gates is known but both the problem to be solved and the outcome of the so defined quantum circuit remain in the shadow? This…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “quantum gates”
Universal Braiding Quantum Gatesquant-ph
Simple construction for universal quantum gates.
problem Designing efficient quantum gates for topological computers.
method Demonstrated a simple construction for unitary solutions of the braided Yang-Baxter equation in any dimension.
result Proved the existence of universal quantum gates in any dimension.
Quantum optimization aids in financial crash prediction and portfolio management.
problem Hard financial optimization problems.
method Quantum algorithms for financial crashes and portfolio optimization.
result Quantum strategies improve financial prediction and portfolio management.
Explaining Quantum Circuits with Shapley Values: Towards Explainable Quantum Machine Learningquant-ph
Quantum circuits explained using Shapley values for better understanding.
problem Improving the explainability of quantum machine learning circuits.
method Applying Shapley values to quantify gate importance in quantum circuits.
result Quantum circuits can be explained by their gate importance, enhancing understanding and interpretability.
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.
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.
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 …
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.
It has been shown that non-stabilizer eigenstates of permutation gates are appropriate for allowing -dimensional universal quantum computing (uqc) based on minimal informationally complete POVMs. The relevant quantum gates may be built from subgroups of finite index of the modular group [M. Pla…
Single T-gate makes distribution learning hard for deep circuits.
problem Learning probability distributions from quantum circuits.
method Characterization of learnability and simulatability of quantum circuit outputs.
result Injection of a single T-gate into depth n^Ω(1) circuits makes distribution learning hard.
Quantum machine learning generalizes well from limited data.
problem Generalization in quantum machine learning from few training data.
method Optimizing parameterized quantum circuits on training data sets and analyzing generalization error.
result Generalization error scales at worst as √(T/N) and improves to √(K/N) when only K gates change.
Enhances quantum sensing by eliminating multiple oscillations in field amplitude estimation.
problem Multiple oscillations in field amplitude estimation due to inter-qubit interactions at high qubit densities.
method Adopting a quantum circuit learning framework to approximate a target function by optimizing gate parameters.
result Elimination of multiple oscillations, leading to enhanced dynamic range of quantum sensing.
Any solution to the Yang-Baxter equation yields a family of representations of braid groups. Under certain conditions, identified by Turaev, the appropriately normalized trace of these representations yields a link invariant. Any Yang-Baxter solution can be interpreted as a two-qudit quantum gate. Here we show that if …
Study shows limitations and universality of equivariant QNNs with -equivariant gates.
problem Understanding the expressiveness of -equivariant QNNs with -body gates.
method Investigated the interplay between symmetry and -bodyness in -equivariant QNN generators.
result QNNs are semi-universal but not universal with one- and two-body -equivariant gates.
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.
Quantum control is valuable for various quantum technologies such as high-fidelity gates for universal quantum computing, adaptive quantum-enhanced metrology, and ultra-cold atom manipulation. Although supervised machine learning and reinforcement learning are widely used for optimizing control parameters in classical …
We show how to train a quantum network of pairwise interacting qubits such that its evolution implements a target quantum algorithm into a given network subset. Our strategy is inspired by supervised learning and is designed to help the physical construction of a quantum computer which operates with minimal external cl…
We introduce a recoupling theory for virtual braided trees. This recoupling theory can be utilized to incorporate swap gates into anyonic models of quantum computation.
Hybrid quantum-classical method optimizes financial index tracking.
problem Optimizing asset weights for financial index replication.
method Hybrid quantum-classical optimization with pruning algorithm.
result Improved performance through quantum and classical optimization.
Preparation of 3-qubit statesquant-ph
New method prepares 3-qubit states using local gates and controlled-Z gates.
problem Preparation of 3-qubit states using quantum gates.
method Uses gates and controlled- gates, with an optimal number of controlled- gates.
result Optimal number of controlled- gates for preparing 3-qubit states is four.
New method uses single quantum state for machine learning tasks, improving accuracy.
problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.
The study examines how quantum resources enhance the complexity of quantum circuits.
problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.
Quantum machine learning improves satellite image alignment.
problem Align satellite images taken at different times and angles.
method Quantum machine learning techniques for feature extraction and matching.
result Quantum methods show potential for future improvements.
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.
A new approach to quantum machine learning circuits reduces training difficulties.
problem Challenges in training deep quantum circuits due to flat training landscapes.
method Variable structure approach (VAns) to build ansatzes, applying rules for gate growth and removal.
result VAns successfully mitigates trainability and noise-related issues, improving performance in various applications.
Quantum circuits reveal pathways to dequantization in machine learning models.
problem Navigating the complex landscape of quantum machine learning models and algorithms.
method Introducing a framework connecting quantum circuit structure to function representability.
result Fundamental properties of quantum circuits determine classical simulability of models.
Finding the Optimal Currency Composition of Foreign Exchange Reserves with a Quantum Computerecon.GN
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.
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.
Quantum Signal Processing reduces derivative pricing quantum resource requirements.
problem Efficiently pricing financial derivatives on quantum computers.
method Quantum Signal Processing (QSP) to encode payoffs directly into quantum amplitudes.
result Significantly reduces quantum resources (T-gates and qubits) for practical derivative contracts.
The effect of data encoding on the expressive power of variational quantum machine learning modelsquant-ph
Quantum models can approximate any function if data encoding allows for a rich enough frequency spectrum.
problem Theoretical properties of quantum machine learning models, particularly their expressive power.
method Investigated how data encoding affects the expressive power of parametrized quantum circuits.
result Quantum models can access increasingly rich frequency spectra by repeating data encoding gates, potentially making them universal function approximators.
Evolutionary strategy optimizes quantum circuit design and parameters.
problem Optimizing quantum circuit design and parameters for NISQ devices.
method Simple evolutionary strategy to optimize both circuit architecture and parameters.
result Minor slowdown on actual quantum hardware compared to simulations, with insights into mutation operations.
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…
New non-semisimple Ising anyons enable robust universal quantum computation.
problem Limitation of semisimple theories in universal topological quantum computation.
method Developed non-semisimple Ising anyon model with new anyon types indexed by .
result Robust universality of braiding persists over an open interval of .
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.
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there …
Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industriesquant-ph
Quantum machine learning boosts drug discovery efficiency.
problem Enhancing drug discovery through quantum computing.
method Quantum neural networks on gate-based quantum computers.
result Significant advancements in molecular property prediction and generation.
Study online learning of quantum processes, showing feasibility for certain types.
problem Learning quantum processes adaptively, especially for bounded gate complexity and Pauli channels.
method Online learning, mistake-bounded model, multiplicative weights update algorithm, Bell sampling.
result Online learning feasible for quantum channels of bounded gate complexity and Pauli channels.
Complex abelian varieties and quantum error correction: a mathematical framework for GKP codesmath.AG
Quantum codes linked to abelian varieties, providing mathematical rigor.
problem Quantum error correction through complex abelian varieties.
method Mathematical formulation of Gottesman-Kitaev-Preskill codes using abelian varieties.
result Asymptotic isometry of encoding, precise gate realizations, and failure probability optimization.
UKM framework optimizes VQCs, showing QCL performance is bounded.
problem Designing and optimizing variational quantum classifiers (VQCs).
method Unitary Kernel Method (UKM) and Variational Circuit Realization (VCR).
result QCL performance is bounded by UKM.
Gaussian processes (GP) are a widely used model for regression problems in supervised machine learning. Implementation of GP regression typically requires logic gates. We show that the quantum linear systems algorithm [Harrow et al., Phys. Rev. Lett. 103, 150502 (2009)] can be applied to Gaussian process regre…
The quantum navigation problem of finding the time-optimal control Hamiltonian that transports a given initial state to a target state through quantum wind, that is, under the influence of external fields or potentials, is analysed. By lifting the problem from the state space to the space of unitary gates realising the…
Quantum algorithms simulate and exponentiate correlated Gaussian vectors for financial modeling.
problem Efficiently simulate and exponentiate correlated Gaussian vectors for financial applications.
method Proposes quantum algorithms for preparing and exponentiating normalised correlated Gaussian random vectors.
result Achieves subcubic complexity in for quantum state preparation, providing a quantum advantage over classical methods.
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering, the most abstract reaches of theoretical physics has spawned topological models ha…
MBQC linked to CQCA, yielding efficient Ansätze.
problem Quantum computation efficiency and Ansatz adaptation.
method Relating MBQC to CQCA and constructing Ansätze.
result MBQC Ansätze can lead to different performances on learning tasks.
Quantum algorithm for multi-asset option pricing under different volatility models.
problem Efficiently pricing multi-asset options under various volatility models using quantum computing.
method Developed an end-to-end quantum PDE framework for European option pricing, solving PDEs after discretization on spatial grids.
result Quantum framework provides polynomial improvement in resource usage compared to classical methods.
Quantum models learn unitary actions on entangled states from product states.
problem Generalization to out-of-distribution data in quantum machine learning.
method Proved out-of-distribution generalization for learning unitary actions.
result Learned unitary actions on entangled states from product states.
Quantum algorithm improves portfolio construction accuracy.
problem Efficiently constructing portfolios with real-world constraints.
method Sampling-based CVaR Variational Quantum Algorithm (VQA) combined with local-search post-processing.
result Achieved a relative solution error of 0.49% on IBM Heron processors.
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 …