Related papers: Assessing the Practical Feasibility of the Clader-…
With the rapid development of quantum computers, quantum algorithms have been studied extensively. However, quantum algorithms tackling statistical problems are still lacking. In this paper, we propose a novel non-oracular quantum adaptive…
Hundreds of satellites equipped with cameras orbit the Earth to capture images from locations for various purposes. Since the field of view of the cameras is usually very narrow, the optics have to be adjusted and rotated between single…
We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…
Solving large-scale linear systems problems is a cornerstone in scientific and industrial computing. Classical iterative solvers face increasing difficulty as the number of unknowns becomes large, while fully quantum linear solvers require…
Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the…
A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
Quantum algorithm involves the manipulation of amplitudes and computational basis, of which manipulating basis is largely a quantum analogue of classical computing that is always a major contributor to the complexity. In order to make full…
Quantum computers have the potential to solve certain problems faster than classical computers by exploiting quantum mechanical effects such as superposition. However, building high-quality quantum software is challenging due to the…
We present a novel quantum high-dimensional linear regression algorithm with an $\ell_1$-penalty based on the classical LARS (Least Angle Regression) pathwise algorithm. Similarly to available classical algorithms for Lasso, our quantum…
Quantum computing and modern tensor-based computing have a strong connection, which is especially demonstrated by simulating quantum computations with tensor networks. The other direction is less studied: quantum computing is not often…
We consider whether trainable quantum unitaries can be used to discover quantum speed-ups for classical problems. Using methods recently developed for training quantum neural nets, we consider Simon's problem, for which there is a known…
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (>1000km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication…
Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an…
Quantum computing is poised to redefine the algorithmic foundations of communication systems. While quantum superposition and entanglement enable quadratic or exponential speedups for specific problems, identifying use cases where these…
Quantum computing promises to tackle technological and industrial problems insurmountable for classical computers. However, today's quantum computers still have limited demonstrable functionality, and it is expected that scaling up to…
Nearest-neighbour clustering is a powerful set of heuristic algorithms that find natural application in the decoding of signals transmitted using the M-Quadrature Amplitude Modulation (M-QAM) protocol. Lloyd et al. proposed a quantum…
We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do not appear…
Computational modeling of cellular systems, where reactants are governed by biochemical equations and physical representations, requires extensive classical computing resources. These limitations significantly constrain the system size and…
To investigate the fundamental nature of matter and its interactions, particles are accelerated to very high energies and collided inside detectors, producing a multitude of other particles that are scattered in all directions. As charged…