Saved in:
Bibliographic Details
Main Authors: Santos, Victor F. dos, Maziero, Jonas
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2403.14703
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929451963514880
author Santos, Victor F. dos
Maziero, Jonas
author_facet Santos, Victor F. dos
Maziero, Jonas
contents Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines a deterministic algorithm making possible the implementation of this theoretical concept on scalable fault-tolerant qubit-based quantum computers. We prove that the diagonal unitary operations employed in our algorithm exhibit a polynomial-time complexity of degree two, contrasting with the previously reported exponential complexity of general diagonal unitaries.
format Preprint
id arxiv_https___arxiv_org_abs_2403_14703
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Using quantum computers to identify prime numbers via entanglement dynamics
Santos, Victor F. dos
Maziero, Jonas
Quantum Physics
Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines a deterministic algorithm making possible the implementation of this theoretical concept on scalable fault-tolerant qubit-based quantum computers. We prove that the diagonal unitary operations employed in our algorithm exhibit a polynomial-time complexity of degree two, contrasting with the previously reported exponential complexity of general diagonal unitaries.
title Using quantum computers to identify prime numbers via entanglement dynamics
topic Quantum Physics
url https://arxiv.org/abs/2403.14703