Quantum switching and quantum merge sorting

DOI10.1109/TCSI.2005.856669MaRDI QIDQ4590479zbMATH OpenOpenAlexFDO

Authors Sheng-Tzong Cheng, Chun-Yen Wang

Publication date 20 November 2017

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2005.856669

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Recommendations

• Quantum time-space tradeoffs for sorting
• Optimal merging in quantum k-xor and k-sum algorithms
• Simultaneous sorting many qudits using different input ports
• Probabilistic comparing and sorting non-orthogonal quantum states
• Quantum complexities of ordered searching, sorting, and element distinctness
• scientific article; zbMATH DE number 1756014
• A SWAP gate for qudits
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network
• Permutational quantum computing
• On a generalized quantum swap gate

Cited in

(12)

• A centralized quantum switch network based on probabilistic channels
• A cost-effective quantum protocol for secure multi-party multiplication
• Cryptanalysis of secure multiparty quantum summation
• Secret sharing based multiparty quantum computation for multiplication
• The power of qutrit logic for quantum computation
• Faithful teleportation via multi-particle quantum states in a network with many agents
• Lead commutation for quantum switching
• Quantum Version of the k‐NN Classifier Based on a Quantum Sorting Algorithm
• A privacy preserving quantum aggregating technique
• Quantum key distribution in multiparty computation for data sorting by entanglement
• The improved quantum switching mechanism based on contention
• Quantum cooperative search algorithm for 3-sat

This page was built for publication: Quantum switching and quantum merge sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4590479)