arXiv subjects

Amit Te'eni

Publications and source records attributed to Amit Te'eni.

13 recordsLinked to original sources

arXiv2025

One-Query Quantum Algorithms for the Index-$q$ Hidden Subgroup Problem

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 Deutsch-Jozsa algorithm requires neither a QFT nor a domain group structure. In contrast, the Bernstein-Vazirani problem is an instance of the hidden subgroup problem (HSP), where the hidden subgroup has either index $1$ or $2$, and the Bernstein-Vazirani algorithm exploits this promise to solve the problem with a single query. Motivated by these insights, we introduce the index-$q$ HSP: determine whether a hidden subgroup $H \le G$ has index $1$ or $q$, and, when possible, identify $H$. We present a single-query algorithm that always distinguishes index $1$ from $q$, for any choice of abelian structure on the oracle's codomain. Moreover, with suitable pre- and post-oracle unitaries (inverse-QFT/QFT over $G$), the same query exactly identifies $H$ under explicit minimal conditions: $G/H$ is cyclic of order $q$, and the output alphabet is equipped, up to affine relabeling, with a compatible $ \mathbb{Z} / q \mathbb{Z} $ structure. These conditions hold automatically for $q \in \left\{ 2,3 \right\} $, giving unconditional single-query identification in these cases. In contrast, the Shor-Kitaev sampling approach cannot guarantee exact recovery from a single sample. Our results sharpen the landscape of one-query quantum solvability for abelian HSPs.

quant-ph↗

arXiv2025

Optimal Quantum Likelihood Estimation

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 subsequent quantum operations. These algorithms are especially valuable in the noisy intermediate-scale quantum (NISQ) era, where quantum resources are constrained and classical optimization plays a central role. Here, we improve the performance of a hybrid algorithm through principled, information-theoretic optimization. We focus on Quantum Likelihood Estimation (QLE) - a hybrid algorithm designed to identify the Hamiltonian governing a quantum system by iteratively updating a weight distribution based on measurement outcomes and Bayesian inference. While QLE already achieves convergence using quantum measurements and Bayesian inference, its efficiency can vary greatly depending on the choice of parameters at each step. We propose an optimization strategy that dynamically selects the initial state, measurement basis, and evolution time in each iteration to maximize the mutual information between the measurement outcome and the true Hamiltonian. This approach builds upon the information-theoretic framework recently developed in [A. Te'eni et al. Oracle problems as communication tasks and optimization of quantum algorithms, arXiv:2409.15549], and leverages mutual information as a guiding cost function for parameter selection. Our implementation employs a simulated annealing routine to minimize the conditional von Neumann entropy, thereby maximizing information gain in each iteration. The results demonstrate that our optimized version significantly reduces the number of iterations required for convergence, thus proposing a practical method for accelerating Hamiltonian learning in quantum systems. Finally, we propose a general scheme that extends our approach to solve a broader family of quantum learning problems.

quant-ph↗

arXiv2025

Equivalence of mutually unbiased bases via orbits: general theory and a $d=4$ case study

In quantum mechanics, mutually unbiased bases (MUBs) represent orthonormal bases that are as "far apart" as possible, and their classification reveals rich underlying geometric structure. Given a complex inner product space, we construct the space of its orthonormal bases as a discrete quotient of the complete flag manifold. We introduce a metric on this space, which corresponds to the "MUBness" distance. This allows us to describe equivalence between sets of mutually unbiased bases in terms of the geometry of this space. The subspace of bases that are unbiased with respect to the standard basis decomposes into orbits under a certain group action, and this decomposition corresponds to the classification of complex Hadamard matrices. More generally, we consider a list of $k$ MUBs, that one wishes to extend. The candidates are points in the subspace comprising all bases which are unbiased with respect to the entire list. This space also decomposes into orbits under a group action, and we prove that points in distinct orbits yield inequivalent MUB lists. Thus, we generalize the relation between complex Hadamard matrices and MUBs. As an application, we identify new symmetries that reduce the parameter space of MUB triples in dimension $4$ by a factor of $4$.

math-ph↗

arXiv2025

Non-classicality at equilibrium and efficient predictions under non-commuting charges

A quantum thermodynamic system can conserve non-commuting observables, but the consequences of this phenomenon on relaxation are still not fully understood. We investigate this problem by leveraging an observable-dependent approach to equilibration and thermalization in isolated quantum systems. We extend such approach to scenarios with non-commuting charges, and show that it can accurately estimate the equilibrium distribution of coarse observables without access to the energy eigenvalues and eigenvectors. Our predictions do not require weak coupling and are not restricted to local observables, thus providing an advantage over the non-Abelian thermal state. Within this approach, weak values and quasiprobability distributions emerge naturally and play a crucial role in characterizing the equilibrium distributions of observables. We show and numerically confirm that, due to charges' non-commutativity, these weak values can be anomalous even at equilibrium, which has been proven to be a proxy for non-classicality. Our work thus uncovers a novel connection between the relaxation of observables under non-commuting charges, weak values, and Kirkwood-Dirac quasiprobability distributions.

quant-ph↗

arXiv2024

Oracle problems as communication tasks and optimization of quantum algorithms

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 learning task using only a fixed number of queries. In this work, we propose measuring an algorithm's performance using the mutual information between the output and the actual value. The task of optimizing this mutual information using a single query, is similar to a basic task of quantum communication, where one attempts to maximize the mutual information of the sender and receiver. We make this analogy precise by splitting the algorithm between two agents, obtaining a communication protocol. The oracle's target property plays the role of a message that Alice encodes into a quantum state, which is subsequently sent over to Bob. The first part of the algorithm performs this encoding, and the second part measures the state and aims to deduce the message from the outcome. Moreover, we formally consider the oracle as a separate subsystem, whose state records the unknown oracle identity. Within this construction, Bob's optimal measurement basis minimizes the quantum correlations between the two subsystems. We also find a lower bound on the mutual information, which is related to quantum coherence. These results extend to multiple-query non-adaptive algorithms. As a result, we describe the optimal non-adaptive algorithm that uses at most a fixed number of queries, for any oracle classification problem. Crucially, this mutual-information perspective carries direct practical utility for algorithmic design, providing the theoretical foundation to optimize iterative subroutines in hybrid quantum--classical schemes. Within the present work, we apply this framework to analyze the stage-by-stage information flow and track partial progress in several standard quantum algorithms.

quant-ph↗

arXiv2023

Quantum circuits for measuring weak values, Kirkwood--Dirac quasiprobability distributions, and state spectra

Weak values and Kirkwood--Dirac (KD) quasiprobability distributions have been independently associated with both foundational issues in quantum theory and advantages in quantum metrology. We propose simple quantum circuits to measure weak values, KD distributions, and spectra of density matrices without the need for post-selection. This is achieved by measuring unitary-invariant, relational properties of quantum states, which are functions of Bargmann invariants, the concept that underpins our unified perspective. Our circuits also enable experimental implementation of various functions of KD distributions, such as out-of-time-ordered correlators (OTOCs) and the quantum Fisher information in post-selected parameter estimation, among others. An upshot is a unified view of nonclassicality in all those tasks. In particular, we discuss how negativity and imaginarity of Bargmann invariants relate to set coherence.

quant-ph↗

arXiv2023

Multipartite Entanglement Detection via Correlation Minor Norm

Entanglement is a uniquely quantum resource giving rise to many quantum technologies. It is therefore important to detect and characterize entangled states, but this is known to be a challenging task, especially for multipartite mixed states. The correlation minor norm (CMN) was recently suggested as a bipartite entanglement detector employing bounds on the quantum correlation matrix. In this paper we explore generalizations of the CMN to multipartite systems based on matricizations of the correlation tensor. It is shown that the CMN is able to detect and differentiate classes of multipartite entangled states. We further analyze the correlations within the reduced density matrices and show their significance for entanglement detection. Finally, we employ matricizations of the correlation tensor for introducing a measure of global quantum discord.

quant-ph↗

arXiv2022

Non-inertial quantum clock frames lead to non-Hermitian dynamics

The operational approach to time is a cornerstone of relativistic theories, as evidenced by the notion of proper time. In standard quantum mechanics, however, time is an external parameter. Recently, many attempts have been made to extend the notion of proper time to quantum mechanics within a relational framework. Here, we use similar ideas combined with the relativistic mass-energy equivalence to study an accelerating massive quantum particle with an internal clock system. We show that the ensuing evolution from the perspective of the particle's internal clock is non-Hermitian. This result does not rely on specific implementations of the clock. As a particular consequence, we prove that the effective Hamiltonian of two gravitationally interacting particles is non-Hermitian from the perspective of the clock of either particle.

quant-ph↗

arXiv2021

Study of entanglement via a multi-agent dynamical quantum game

At both conceptual and applied levels, quantum physics provides new opportunities as well as fundamental limitations. We hypothetically ask whether quantum games inspired by population dynamics can benefit from unique features of quantum mechanics such as entanglement and nonlocality. For doing so we extend quantum game theory and demonstrate that in certain models mimicking ecological systems where several predators feed on the same prey, the strength of quantum entanglement between the various species has a profound effect on the asymptotic behavior of the system. For example, if there are sufficiently many predator species who are all equally correlated with their prey, they are all driven to extinction. Our results are derived in two ways: by analyzing the asymptotic dynamics of the system, and also by modeling the system as a quantum correlation network. The latter approach enables us to apply various tools from classical network theory in the above quantum scenarios. Several generalizations and applications are discussed.

quant-ph↗

arXiv2020

Correlation Minor Norms, Entanglement Detection and Discord

In this paper we develop an approach for detecting entanglement, which is based on measuring quantum correlations and constructing a correlation matrix. The correlation matrix is then used for defining a family of parameters, named Correlation Minor Norms, which allow one to detect entanglement. This approach generalizes the computable cross-norm or realignment (CCNR) criterion, and moreover requires measuring a state-independent set of operators. Furthermore, we illustrate a scheme which yields for each Correlation Minor Norm a separable state that maximizes it. The proposed entanglement detection scheme is believed to be advantageous in comparison to other methods because correlations have a simple, intuitive meaning and in addition they can be directly measured in experiment. Moreover, it is demonstrated to be stronger than the CCNR criterion. We also illustrate the relation between the Correlation Minor Norm and entanglement entropy for pure states. Finally, we discuss the relation between the Correlation Minor Norm and quantum discord. We demonstrate that the CMN may be used to define a new measure for quantum discord.

quant-ph↗

arXiv2020

Experimental tests of Multiplicative Bell Inequalities

Bell inequalities are mathematical constructs that demarcate the boundary between quantum and classical physics. A new class of multiplicative Bell inequalities originating from a volume maximization game (based on products of correlators within bipartite systems) has been recently proposed. For these new Bell parameters, it is relatively easy to find the classical and quantum, i.e. Tsirelson, limits. Here, we experimentally test the Tsirelson bounds of these inequalities using polarisation-entangled photons for different number of measurements ($n$), each party can perform. For $n=2, 3, 4$, we report the experimental violation of local hidden variable theories. In addition, we experimentally compare the results with the parameters obtained from a fully deterministic strategy, and observe the conjectured nature of the ratio. Finally, utilizing the principle of "relativistic independence" encapsulating the locality of uncertainty relations, we theoretically derive and experimentally test new richer bounds for both the multiplicative and the additive Bell parameters for $n=2$. Our findings strengthen the correspondence between local and nonlocal correlations, and may pave the way for empirical tests of quantum mechanical bounds with inefficient detection systems.

quant-ph↗

arXiv2020

Double Slit with an Einstein-Podolsky-Rosen Pair

In this somewhat pedagogical paper we revisit complementarity relations in bipartite quantum systems. Focusing on continuous variable systems, we examine the influential class of EPR-like states through a generalization to Gaussian states and present some new quantitative relations between entanglement and local interference within symmetric and asymmetric double-double-slit scenarios. This approach is then related to ancilla-based quantum measurements, and weak measurements in particular. Finally, we tie up the notions of distinguishability, predictability, coherence and visibility while drawing some specific connections between them.

quant-ph↗

arXiv2019

Multiplicative Bell Inequalities

Bell inequalities are important tools in contrasting classical and quantum behaviors. To date, most Bell inequalities are linear combinations of statistical correlations between remote parties. Nevertheless, finding the classical and quantum mechanical (Tsirelson) bounds for a given Bell inequality in a general scenario is a difficult task which rarely leads to closed-form solutions. Here we introduce a new class of Bell inequalities based on products of correlators that alleviate these issues. Each such Bell inequality is associated with a unique coordination game. In the simplest case, Alice and Bob, each having two random variables, attempt to maximize the area of a rectangle and the rectangle's area is represented by a certain parameter. This parameter, which is a function of the correlations between their random variables, is shown to be a Bell parameter, i.e. the achievable bound using only classical correlations is strictly smaller than the achievable bound using non-local quantum correlations We continue by generalizing to the case in which Alice and Bob, each having now n random variables, wish to maximize a certain volume in n-dimensional space. We term this parameter a multiplicative Bell parameter and prove its Tsirelson bound. Finally, we investigate the case of local hidden variables and show that for any deterministic strategy of one of the players the Bell parameter is a harmonic function whose maximum approaches the Tsirelson bound as the number of measurement devices increases. Some theoretical and experimental implications of these results are discussed.

quant-ph↗