Solving the Learning Parity with Noise Problem Using Quantum Algorithms

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In this work, we study online submodular maximization and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best-possible approximation ratio that is attainable when the algorithm is allowe ...

This limitation is circumvented by using scalable and non–memory–intensive harmonic expansions. In this paper, the projection of parametric surfaces onto disk and spherical harmonics bases is investigated, and three novel computationally efficient algorith ...

SKIPTRAIN is a novel Decentralized Learning (DL) algorithm, which minimizes energy consumption in decentralized learning by strategically skipping some training rounds and substituting them with synchronization rounds. These trainingsilent periods, besides ...

The continued development of computational approaches to many-body ground-state problems in physics and chemistry calls for a consistent way to assess its overall progress. In this work, we introduce a metric of variational accuracy, the V-score, obtained ...

The Tensor Isomorphism Problem (TIP) has been shown equivalent to the matrix code equivalence problem, making it an interesting candidate on which to build post-quantum cryptographic primitives. These hard problems have already been used in protocol develo ...

Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...

We propose Grab-UCB, a graph-kernelmulti-arms bandit algorithm to learn online the optimal source placement in large scale networks, such that the reward obtained from a priori unknown network processes is maximized. The uncertainty calls for online learni ...

The goal of this thesis is the development and the analysis of numerical methods for problems where the unknown is a curve on a smooth manifold. In particular, the thesis is structured around the three following problems: homotopy continuation, curve inter ...

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

A crucial milestone in the field of quantum simulation and computation is to demonstrate that a quantum device can perform a computation task that is classically intractable. A key question is to identify setups that can achieve such goal within current te ...

This paper presents a distributed shadow dynamic consensus (DSDC) framework to address the generation company (GENCO) strategic bidding problem in the independent system operator (ISO) operation. First, each sub-group is defined according to the communicat ...

It's been a little more than 40 years since researchers first suggested exploiting quantum physics to build more powerful computers. During this time, we have seen the development of many quantum algorithms and significant technological advances to make th ...

Universal and fault-tolerant quantum computation is a promising new paradigm that may efficiently conquer difficult computation tasks beyond the reach of classical computation. It motivates the development of various quantum technologies. The rapid progres ...

Many-body Green's functions encode all the properties and excitations of interacting electrons. While these are challenging to be evaluated accurately on a classical computer, recent efforts have been directed toward finding quantum algorithms that may pro ...

In this work, we develop timing-driven CAD support for FPGA architectures with direct connections between LUTs. We do so by proposing an efficient ILP-based detailed placer, which moves a carefully selected subset of LUTs from their original positions, so ...

Loading classical data into quantum registers is one of the most important primitives of quantum computing. While the complexity of preparing a generic quantum state is exponential in the number of qubits, in many practical tasks the state to prepare has a ...

We present a general framework to find ε-equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models. Consumer choices are modeled according to random utility theory, and the choice proba ...

A CUR approximation of a matrix A is a particular type of low-rank approximation A approximate to CUR, where C and R consist of columns and rows of A, respectively. One way to obtain such an approximation is to apply column subset selection to A and A(T). ...

Decentralized stochastic optimization methods have gained a lot of attention recently, mainly because of their cheap per iteration cost, data locality, and their communication-efficiency. In this paper we introduce a unified convergence analysis that cover ...

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new ...

Solving the Learning Parity with Noise Problem Using Quantum Algorithms

Chat with Graph Search

The Cost of Consistency: Submodular Maximization with Constant Recourse

On the conjugate symmetry and sparsity of the harmonic decomposition of parametric surfaces with the randomised Kaczmarz method

Energy-Aware Decentralized Learning with Intermittent Model Training

Variational benchmarks for quantum many-body problems

Solving the Tensor Isomorphism Problem for Special Orbits with Low Rank Points: Cryptanalysis and Repair of an Asiacrypt 2023 Commitment Scheme

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Online Network Source Optimization with Graph-Kernel MAB

Retraction-based numerical methods for continuation, interpolation and time integration on manifolds

Maximum Independent Set: Self-Training through Dynamic Programming

Signatures of a sampling quantum advantage in driven quantum many-body systems

Distributed Shadow Dynamic Consensus Optimization Framework for Power Market with Parameterization Bidding Strategy of GENCOs

Practical Compilation of Quantum Programs

Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective

One-particle Green's functions from the quantum equation of motion algorithm

Detailed Placement for Dedicated LUT-Level FPGA Interconnect

Efficient deterministic preparation of quantum states using decision diagrams

A disaggregate choice-based approach to find ε-equilibria of oligopolistic markets

Low-Rank Approximation In The Frobenius Norm By Column And Row Subset Selection

A Unified Theory of Decentralized SGD with Changing Topology and Local Updates

Compressive sensing adaptation for polynomial chaos expansions