6 papers
One-Query Quantum Algorithms for the Index- Hidden Subgroup Problem
Amit Te'eni, Yaron Oz, Eliahu Cohen
The quantum Fourier transform (QFT) is central to many quantum algorithms, yet its necessity is not always well understood. We re-examine its role in canonical query problems. The…
Oracle problems as communication tasks and optimization of quantum algorithms
Amit Te'eni, Zohar Schwartzman-Nowik, Marcin Nowakowski +2
Quantum query complexity studies the number of queries needed to learn some property of a black box. A closely related question is how well an algorithm can succeed with this learn…
Quantum Circuit Cutting: Complexity and Optimization
Yuval Idan, Eitan Zahavi, Elad Mentovich +2
The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To add…
Weak Value Advantage in Overcoming Noise
Zohar Schwartzman-Nowik, Dorit Aharonov, Eliahu Cohen
The weak value exhibits numerous intriguing characteristics, such as values outside the operator spectrum, leading to unexpected phenomena. Nevertheless, the measurement protocol u…
Optimal Quantum Likelihood Estimation
Alon Levi, Ziv Ossi, Eliahu Cohen +1
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subs…
Equivalence of mutually unbiased bases via orbits: general theory and a case study
Amit Te'eni, Eliahu Cohen
In quantum mechanics, mutually unbiased bases (MUBs) represent orthonormal bases that are as "far apart" as possible, and their classification reveals rich underlying geometric str…