Skip to main content

Advanced Search

Projected result for your current search: 0

Search Operators:

You can use operators in your search query to narrow down your results even more. Click on the search operator to see an explanation of how it works.
Finds documents with exactly this word group, in exactly this word order and spelling (e.g. "employer branding").
Finds documents with both search terms (e.g. sales AND bonus).
Finds documents with one or the other search term (e.g. porsche OR volkswagen).
Finds documents with all search terms. Blank space is understood as AND (e.g. man robot production).
Finds documents with no appearance of the word behind NOT (e.g. ford NOT "harrison ford").
Finds documents where the search term is mentioned at least "n" times."n" may be any number (e.g. COUNT(gear)>8).
Finds documents with both search terms in any word order, permitting "n" words as a maximum distance between them. Best choose between 15 and 30 (e.g. NEAR(recruit, professionals, 20)).
Finds documents with the search term in word versions or composites. The asterisk * marks whether you wish them BEFORE, BEHIND, or BEFORE and BEHIND the search term (e.g. lightweight*, *lightweight, *lightweight*).
Finds documents with the search term in different spellings. "?" allows only one character (e.g. organi?ation).
Special characters are understood as AND (e.g. Miller Bros. & Sons).

Semantic Search

powered by (Link opens in a new window)
loading …
Log in
Top
Quantum Information Processing

Tree-based quantum anonymous ranking protocol

  • 01-07-2024
Published in:
Authors
Justin Joseph
Syed Taqi Ali
Published in
Quantum Information Processing | Issue 7/2024

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The article introduces a tree-based quantum anonymous ranking protocol that addresses the limitations of existing quantum anonymous multiparty multidata ranking (QAMMR) protocols. By employing binary search trees, the proposed protocol reduces the number of required quantum particles and improves security by revealing only the range of data. The protocol works in several rounds, where each round denotes a level in the binary search tree, and participants encode their data in quantum sequences. The paper explains the preliminaries, protocol steps, security analysis, and performance analysis, highlighting the advantages of the tree-based approach in terms of efficiency and security. The article concludes with a comparison to existing QAMMR protocols and discusses the practical implementation of the proposed protocol in IBM Qiskit.
AI Generated

This summary of the content was generated with the help of AI.

Please log in to get access to your license.

Log in Register for free

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Business + Economics & Engineering + Technology"

Online-Abonnement

Springer Professional "Business + Economics & Engineering + Technology" gives you access to:

  • more than 102.000 books
  • more than 537 journals

from the following subject areas:

  • Automotive
  • Construction + Real Estate
  • Business IT + Informatics
  • Electrical Engineering + Electronics
  • Energy + Sustainability
  • Finance + Banking
  • Management + Leadership
  • Marketing + Sales
  • Mechanical Engineering + Materials
  • Insurance + Risk


Secure your knowledge advantage now!

inform now

Springer Professional "Engineering + Technology"

Online-Abonnement

Springer Professional "Engineering + Technology" gives you access to:

  • more than 67.000 books
  • more than 390 journals

from the following specialised fileds:

  • Automotive
  • Business IT + Informatics
  • Construction + Real Estate
  • Electrical Engineering + Electronics
  • Energy + Sustainability
  • Mechanical Engineering + Materials





 

Secure your knowledge advantage now!

inform now

Springer Professional "Business + Economics"

Online-Abonnement

Springer Professional "Business + Economics" gives you access to:

  • more than 67.000 books
  • more than 340 journals

from the following specialised fileds:

  • Construction + Real Estate
  • Business IT + Informatics
  • Finance + Banking
  • Management + Leadership
  • Marketing + Sales
  • Insurance + Risk



Secure your knowledge advantage now!

inform now
previous article Quantum-compliant users scheduling optimization in joint transmission mobile access networks
next article Lorentz invariants of pure three-qubit states
Title
Tree-based quantum anonymous ranking protocol
Authors
Justin Joseph
Syed Taqi Ali
Publication date
01-07-2024
Publisher
Springer US
Published in
Quantum Information Processing / Issue 7/2024
Print ISSN: 1570-0755
Electronic ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-024-04476-w
This content is only visible if you are logged in and have the appropriate permissions.

Other articles of this Issue 7/2024

Remote state preparation under fluctuating electromagnetic field

The summation and product forms of the uncertainty relations based on metric-adjusted skew information

Quantum-compliant users scheduling optimization in joint transmission mobile access networks

  • Open Access

Unexpected averages of mixing matrices

New quantum codes from Hermitian dual-containing matrix-product codes

Some constructions of quantum MDS codes and EAQMDS codes from GRS codes