Two-step phase shifting interferometry based on orientation selective monogenic filtering

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.

We describe a quantum algorithm for finding the smallest eigenvalue of a Hermitian matrix. This algorithm combines quantum phase estimation and quantum amplitude estimation to achieve a quadratic speedup with respect to the best classical algorithm in term ...

We explore applications of quantum computing for radio interferometry and astronomy using recent developments in quantum image processing. We evaluate the suitability of different quantum image representations using a toy quantum computing image reconstruc ...

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models c ...

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition ...

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 ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

Frequency-bin qubits get the best of time-bin and dual-rail encodings, but require external modulators and pulse shapers to build arbitrary states. Here, instead, the authors work directly on-chip by controlling the interference of biphoton amplitudes gene ...

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting para ...

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

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 ...

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

We propose a variational quantum algorithm to study the real-time dynamics of quantum systems as a ground -state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the ...

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classif ...

Simulating the dynamics and the non-equilibrium steady state of an open quantum system are hard computational tasks on conventional computers. For the simulation of the time evolution, several efficient quantum algorithms have recently been developed. Howe ...

We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits. The method, named "projected - Variational Quantum Dynamics" (p-VQD) realizes an iterative, global projection of the exact ti ...

A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating quantum systems is ...

New post-quantum Key Encapsulation Mechanism (KEM) designs, evaluated as part of the NIST PQC standardization Project, pose challenging tradeoffs between communication bandwidth and computational overheads. Several KEM designs evaluated in Round-2 of the p ...

Two-step phase shifting interferometry based on orientation selective monogenic filtering

Chat with Graph Search

A square-root speedup for finding the smallest eigenvalue

Quantum radio astronomy: Data encodings and quantum image processing

The complexity of quantum support vector machines

Scalable Quantum Algorithms for Noisy Quantum Computers

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Programmable frequency-bin quantum states in a nano-engineered silicon device

Phenomenological theory of variational quantum ground-state preparation

Bayesian reconstruction of memories stored in neural networks from their connectivity

Results on Sparse Integer Programming and Geometric Independent Sets

A continuum approximation approach to the depot location problem in a crowd-shipping system

Efficient Preparation of Cyclic Quantum States

Practical Compilation of Quantum Programs

Approximate CVPp in time 2(0.802n)

Variational dynamics as a ground-state problem on a quantum computer

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

A quantum algorithm for the direct estimation of the steady state of open quantum systems

An efficient quantum algorithm for the time evolution of parameterized circuits

Classical variational simulation of the Quantum Approximate Optimization Algorithm

Fast polynomial inversion for post quantum QC-MDPC cryptography