Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Lattice-Based Inner Product Argument

Veronika Kuchta, Rajeev Anand Sahu, Gaurav Sharma

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-3-031-17433-9_11

Related papers

Lattice theoretic notions

Miklós Rédei

Springer eBooks•Jan 1, 1998•0 citations

On the reality of spectra of U q ( sl 2 )-invariant XXZ Hamiltonians

Alexi Morin-Duchesne, Jørgen Rasmussen, Philippe Ruelle +1 more

Abstract. A new inner product is constructed on each standard module over the Temperley–Lieb algebra T L n ( β ) for β ∈ R and n ⩾ 2 . On these modules, the Hamiltonian h = − ∑ i e i is shown to be self-adjoint with respect to this inner product. This implies that its action on these modules is diagonalisable with real eigenvalues. A representation theoretic argument shows that the reality of spectra of the Hamiltonian extends to all other Temperley–Lieb representations. In particular, this result applies to the celebrated U q ( s l 2 ) -invariant XXZ Hamiltonian, for all q + q − 1 ∈ R .

arXiv:1502.01859•Journal of Statistical Mechanics Theory and Experiment•May 1, 2016•19 citations

Non-Lattice Systems

Karsten Balzer, M. Bönitz

Lecture notes in physics•Dec 12, 2012•0 citations

Decentralized Multi-Authority Attribute-Based Inner-Product Functional Encryption: Noisy and Evasive Constructions from Lattices

Jiaqi Liu, Yan Wang, Fang‐Wei Fu

We study multi-authority attribute-based functional encryption for noisy inner-product functionality, and propose two new primitives: (1) multi-authority attribute-based (noisy) inner-product functional encryption (MA-AB(N)IPFE), which generalizes existing multi-authority attribute-based IPFE schemes by Agrawal et al. (TCC'21), by enabling approximate inner-product computation; and (2) multi-authority attribute-based evasive inner-product functional encryption (MA-evIPFE), a relaxed variant inspired by the evasive IPFE framework by Hsieh et al. (EUROCRYPT'24), shifting focus from ciphertext indistinguishability to a more relaxed pseudorandomness-based security notion. To support the above notions, we introduce two variants of lattice-based computational assumptions: evasive IPFE assumption and indistinguishability-based evasive IPFE assumption (IND-evIPFE). We present lattice-based constructions of both primitives for subset policies, building upon the framework of Waters et al.( TCC'22). Our schemes are proven to be statically secure in the random oracle model under the standard LWE assumption and the newly introduced assumptions. Additionally, we show our MA-AB(N)IPFE scheme can be transformed via modulus switching into a noiseless MA-IPFE scheme that supports exact inner-product functionality. This yields the first lattice-based construction of such a primitive. All our schemes support arbitrary polynomial-size attribute policies and are secure in the random oracle model under lattice assumptions with a sub-exponential modulus-to-noise ratio, making them practical candidates for noise-tolerant, fine-grained access control in multi-authority settings.

arXiv:2505.11744•May 16, 2025•0 citations

4. Euclidean spaces

Arnold Neumaier

There is a notational discrepancy in how mathematicians and physicists treat Hilbert spaces. In physics, one often works with finite-dimensional Hilbert spaces treated as ℂ n , and hence wants to write the Hermitian inner product as (x, y) = x ∗ y. This definition dictates the use of a Hermitian inner product that is antilinear in the first argument, the convention followed, for example, in Reed & Simon [246]. This is also the choice adopted in Dirac’s bracket notation, whose usage in quantum mechanics is very widespread. Our notation is chosen to extend-as closely as possible-the traditional notation of standard finite-dimensional matrix algebra to arbitrary complex inner product spaces and associated linear operators. In matrix algebra, column vectors and the corresponding matrices with one column are identical objects, row vectors are the linear functionals, and the adjoint is the conjugate transpose. For example, ℍ = ℍ × = ℂ n is the space of column vectors of size n, the dual space ℍ ∗ is the space of row vectors of size n, and the operator product ϕ ∗ ψ of a row vector ϕ ∗ and a column vector ψ is the standard Hermitian inner product of the column vectors ϕ and ψ. We use Greek lower case letters to write vectors, thus emphasizing their intended use as quantum state vectors in quantum mechanics. On the other hand, mathematicians working on reproducing kernel Hilbert spaces use an inner product (x, y) antilinear in the second argument, related to the physicist’s inner product (x, y) by (x, y) =( ). This is the convention followed, for example, in Rudin [252]. Although the two ways of defining the inner product lead to fully equivalent theories, all details look a bit different, a fact that has to be taken into account when reading the literature on the subject. For example, in the description based on the physical tradition, it is preferable to work with the antidual space in place of the dual space used in the mathematical tradition. In functional analysis, linear operators in Hilbert spaces are usually considered each with their own domain. But many computations in quantum mechanics require the consideration of algebras of operators with a common domain. The latter is a Euclidean space, a dense subspace of a Hilbert space. This space and its antidual play in many respects a more basic role in quantum physics than the Hilbert space itself. Therefore, and to avoid possible confusion caused by the different traditions, we give in the present chapter a self-contained introduction to Euclidean spaces and their associated spaces. All proofs are carried out in detail.

De Gruyter eBooks•Oct 24, 2019•0 citations

Lattice Systems

Karsten Balzer, M. Bönitz

Lecture notes in physics•Dec 12, 2012•0 citations
Abstract. A new inner product is constructed on each standard module over the Temperley–Lieb algebra T L n ( β ) for β ∈ R and n ⩾ 2 . On these modules, the Hamiltonian h = − ∑ i e i is shown to be self-adjoint with respect to this inner product. This implies that its action on these modules is diagonalisable with real eigenvalues. A representation theoretic argument shows that the reality of spectra of the Hamiltonian extends to all other Temperley–Lieb representations. In particular, this result applies to the celebrated U q ( s l 2 ) -invariant XXZ Hamiltonian, for all q + q − 1 ∈ R .
We study multi-authority attribute-based functional encryption for noisy inner-product functionality, and propose two new primitives: (1) multi-authority attribute-based (noisy) inner-product functional encryption (MA-AB(N)IPFE), which generalizes existing multi-authority attribute-based IPFE schemes by Agrawal et al. (TCC'21), by enabling approximate inner-product computation; and (2) multi-authority attribute-based evasive inner-product functional encryption (MA-evIPFE), a relaxed variant inspired by the evasive IPFE framework by Hsieh et al. (EUROCRYPT'24), shifting focus from ciphertext indistinguishability to a more relaxed pseudorandomness-based security notion. To support the above notions, we introduce two variants of lattice-based computational assumptions: evasive IPFE assumption and indistinguishability-based evasive IPFE assumption (IND-evIPFE). We present lattice-based constructions of both primitives for subset policies, building upon the framework of Waters et al.( TCC'22). Our schemes are proven to be statically secure in the random oracle model under the standard LWE assumption and the newly introduced assumptions. Additionally, we show our MA-AB(N)IPFE scheme can be transformed via modulus switching into a noiseless MA-IPFE scheme that supports exact inner-product functionality. This yields the first lattice-based construction of such a primitive. All our schemes support arbitrary polynomial-size attribute policies and are secure in the random oracle model under lattice assumptions with a sub-exponential modulus-to-noise ratio, making them practical candidates for noise-tolerant, fine-grained access control in multi-authority settings.
There is a notational discrepancy in how mathematicians and physicists treat Hilbert spaces. In physics, one often works with finite-dimensional Hilbert spaces treated as ℂ n , and hence wants to write the Hermitian inner product as (x, y) = x ∗ y. This definition dictates the use of a Hermitian inner product that is antilinear in the first argument, the convention followed, for example, in Reed & Simon [246]. This is also the choice adopted in Dirac’s bracket notation, whose usage in quantum mechanics is very widespread. Our notation is chosen to extend-as closely as possible-the traditional notation of standard finite-dimensional matrix algebra to arbitrary complex inner product spaces and associated linear operators. In matrix algebra, column vectors and the corresponding matrices with one column are identical objects, row vectors are the linear functionals, and the adjoint is the conjugate transpose. For example, ℍ = ℍ × = ℂ n is the space of column vectors of size n, the dual space ℍ ∗ is the space of row vectors of size n, and the operator product ϕ ∗ ψ of a row vector ϕ ∗ and a column vector ψ is the standard Hermitian inner product of the column vectors ϕ and ψ. We use Greek lower case letters to write vectors, thus emphasizing their intended use as quantum state vectors in quantum mechanics. On the other hand, mathematicians working on reproducing kernel Hilbert spaces use an inner product (x, y) antilinear in the second argument, related to the physicist’s inner product (x, y) by (x, y) =( ). This is the convention followed, for example, in Rudin [252]. Although the two ways of defining the inner product lead to fully equivalent theories, all details look a bit different, a fact that has to be taken into account when reading the literature on the subject. For example, in the description based on the physical tradition, it is preferable to work with the antidual space in place of the dual space used in the mathematical tradition. In functional analysis, linear operators in Hilbert spaces are usually considered each with their own domain. But many computations in quantum mechanics require the consideration of algebras of operators with a common domain. The latter is a Euclidean space, a dense subspace of a Hilbert space. This space and its antidual play in many respects a more basic role in quantum physics than the Hilbert space itself. Therefore, and to avoid possible confusion caused by the different traditions, we give in the present chapter a self-contained introduction to Euclidean spaces and their associated spaces. All proofs are carried out in detail.