English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Quantum computers can potentially solve problems that are computationallyintractable on a classical computer in polynomial time using quantum-mechanicaleffects such as superposition and entanglement. The N-Queens Problem is anotable example that falls under the class of NP-complete problems. It involvesthe arrangement of N chess queens on an N x N chessboard such that no queenattacks any other queen, i.e. no two queens are placed along the same row,column or diagonal. The best time complexity that a classical computer hasachieved so far in generating all solutions of the N-Queens Problem is of theorder O(N!). In this paper, we propose a new algorithm to generate allsolutions to the N-Queens Problem for a given N in polynomial time of orderO(N^3) and polynomial memory of order O(N^2) on a quantum computer. We simulatethe 4-queens problem and demonstrate its application to satellite communicationusing IBM Quantum Experience platform.

A Novel Quantum N-Queens Solver Algorithm and its Simulation and Application to Satellite Communication Using IBM Quantum Experience