Related papers: Quantum walk inspired JPEG compression of images
The Gromov-Wasserstein (GW) framework adapts ideas from optimal transport to allow for the comparison of probability distributions defined on different metric spaces. Scalable computation of GW distances and associated matchings on graphs…
I propose a novel framework for quantum image storage using continuous-variable (CV) photonic systems. Unlike traditional qubit-based approaches, this model encodes grayscale image intensities into qumodes via coherent-state displacement…
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify…
The paper focuses on Image Compression, explaining efficient approaches based on Frequent Pattern Mining(FPM). The proposed compression mechanism is based on clustering similar pixels in the image and thus using cluster identifiers in image…
Recent findings suggest that processes such as the electronic energy transfer through the photosynthetic antenna display quantal features, aspects known from the dynamics of charge carriers along polymer backbones. Hence, in modeling energy…
Recently, we have been witnessing the scale-up of superconducting quantum computers; however, the noise of quantum bits (qubits) is still an obstacle for real-world applications to leveraging the power of quantum computing. Although there…
Adaptive measurements were recently shown to significantly improve the performance of quantum state tomography. Utilizing information about the system for the on-line choice of optimal measurements allows to reach the ultimate bounds of…
Quantum image processing (QIMP) has recently emerged as a promising field for modern image processing applications. In QIMP algorithms, encoding classical image informaiton into quantum circuit is important as the first step. However, most…
We present a method to map the evolution of photonic random walks that is compatible with nonclassical input light. Our approach leverages a newly developed flexible waveguide platform to tune the jumping rate between spatial modes,…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
We investigate a framework for binary image denoising via restricted Boltzmann machines (RBMs) that introduces a denoising objective in quadratic unconstrained binary optimization (QUBO) form and is well-suited for quantum annealing. The…
With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum…
Quantum simulation is a cornerstone application for quantum computing, yet standard methods face a trade-off between circuit depth and accuracy: Trotterization depth scales with the number of Hamiltonian terms $L$, while sampling-based…
In recent years, there is a growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design…
Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We…
We implement a quantum generalization of a neural network on trapped-ion and IBM superconducting quantum computers to classify MNIST images, a common benchmark in computer vision. The network feedforward involves qubit rotations whose…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse…
A new estimation scheme based on the split-step quantum walk (SSQW) revealed that by just setting a single parameter, SSQW can potentially achieve quantum Crame\'r-Rao bound in multiparameter estimation. This parameter even does not involve…
The JPEG algorithm is a defacto standard for image compression. We investigate whether adaptive mesh refinement can be used to optimize the compression ratio and propose a new adaptive image compression algorithm. We prove that it produces…