Related papers: Optical implementations, oracle equivalence, and t…
Iterative projection algorithms are successfully being used as a substitute of lenses to recombine, numerically rather than optically, light scattered by illuminated objects. Images obtained computationally allow aberration-free…
We propose an optical implementation of the Gaussian continuous-variable quantum cloning machines. We construct a symmetric N -> M cloner which optimally clones coherent states and we also provide an explicit design of an asymmetric 1 -> 2…
The celebrated quantum no-cloning theorem states that an arbitrary quantum state cannot be cloned perfectly. This raises questions about cloning of classical states, which have also attracted attention. Here, we present a physical approach…
We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can…
Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear…
We investigate an optical quantum memory scheme with V-type three-level atoms based on the controlled reversible inhomogeneous broadening (CRIB) technique. We theoretically show the possibility to store and retrieve a weak light pulse…
Assuming a cloning oracle, satisfiability, which is an NP complete problem, is shown to belong to $BPP^C$ and $BQP^C$ (depending on the ability of the oracle C to clone either a binary random variable or a qubit). The same result is…
We introduce the quantum implementation of a binary classifier based on cosine similarity between data vectors. The proposed quantum algorithm evaluates the classifier on a set of data vectors with time complexity that is logarithmic in the…
This paper describes the passage of light through a system of waveplates mathematically in terms of quaternions, an extension of the complex numbers, instead of the more usual Jones vectors and Jones matrices. Both the light beam and the…
The successful development and optimisation of optically-driven micromachines will be greatly enhanced by the ability to computationally model the optical forces and torques applied to such devices. In principle, this can be done by…
We tackle robust optimization problems under objective uncertainty in the oracle model, i.e., when the deterministic problem is solved by an oracle. The oracle-based setup is favorable in many situations, e.g., when a compact formulation of…
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss…
Quantum computing holds promise across various fields, particularly with the advent of Noisy Intermediate-Scale Quantum (NISQ) devices, which can outperform classical supercomputers in specific tasks. However, challenges such as noise and…
Optical Very Long Baseline Interferometry (VLBI) offers the potential for unprecedented angular resolution in both astronomical imaging and precision measurements. Classical approaches, however, face significant limitations due to photon…
We observe that any $T(n)$ time algorithm (quantum or classical) for several central linear algebraic problems, such as computing $\det(A)$, $tr(A^3)$, or $tr(A^{-1})$ for an $n \times n$ integer matrix $A$, yields a $O(T(n)) + \tilde…
Variational quantum algorithms involve training parameterized quantum circuits using a classical co-processor. An important variational algorithm, designed for combinatorial optimization, is the quantum approximate optimization algorithm.…
We present a theoretical analysis of a novel scheme for optical cooling of particles that does not in principle require a closed optical transition. A tightly confined laser beam interacting with a trapped particle experiences a phase…
This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum algorithm to compute $N$-bit OR functions with…
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where…
Unitary Fourier transform lies at the core of the multitudinous computational and metrological algorithms. Here we show experimentally how the unitary Fourier transform-based phase estimation protocol, used namely in quantum metrology, can…