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

arXiv:1908.04802 · Physical Review Research

Entanglement bounds on the performance of quantum computing architectures

Zachary Eldredge, Leo Zhou, Aniruddha Bapat, James R. Garrison, Abhinav Deshpande, Frederic T. Chong, Alexey V. Gorshkov

Published Aug 26, 2020• 9 citations
arXivHTMLPDF

Abstract

This work studies a new metric for benchmarking quantum computer architectures via the time required for creating large entangled states. The authors derive a lower bound on the creation time, and provide a protocol that saturates the bound up to a logarithmic factor.
DOI
10.1103/physrevresearch.2.033316

Related papers

Entanglement bounds on the performance of quantum computing architectures

Zachary Eldredge, Leo Zhou, Aniruddha Bapat +4 more

There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to evaluate the hierarchical architecture proposed by A. Bapat et al. [Phys. Rev. A 98, 062328 (2018)] and find it to be a promising alternative to the conventional grid architecture. We also show that the lower bound that this metric places on the creation time of highly entangled states can be saturated with a constructive protocol, up to a factor logarithmic in the number of qubits.

•Aug 26, 2020•7 citations

Benchmarking Quantum Computers and the Impact of Quantum Noise

Salonik Resch, Ulya R. Karpuzcu

Benchmarking is how the performance of a computing system is determined. Surprisingly, even for classical computers this is not a straightforward process. One must choose the appropriate benchmark and metrics to extract meaningful results. Different benchmarks test the system in different ways, and each individual metric may or may not be of interest. Choosing the appropriate approach is tricky. The situation is even more open ended for quantum computers, where there is a wider range of hardware, fewer established guidelines, and additional complicating factors. Notably, quantum noise significantly impacts performance and is difficult to model accurately. Here, we discuss benchmarking of quantum computers from a computer architecture perspective and provide numerical simulations highlighting challenges that suggest caution.

arXiv:1912.00546•ACM Computing Surveys•Jul 18, 2021•173 citations

A Novel Algorithm based on Entanglement Measurement for Improving Speed of Quantum Algorithms

Mohammed Zidan, Abdel‐Haleem Abdel‐Aty, Ahmed Younes +3 more

Applied Mathematics & Information Sciences•Jan 1, 2018•53 citations

Generation and Uses of Distributed Entanglement in Quantum Information

Zachary Eldredge

In this thesis, we focus on the questions of how quantum entanglement can be generated between two or more spatially separated systems and, once generated, how it can be applied in quantum technology. First we will discuss a protocol, which we conjecture to be optimal in some regimes, that quickly creates entangled states across long distances in systems with power-law interactions. We will discuss how this protocol compares with currently known bounds on entangled state generation and how it might be implemented in a three-dimensional lattice of Rydberg atoms. Next, we will turn our attention to more general questions of how the Lieb-Robinson bound and other limitations on entanglement can be used to inform the design of quantum computers. Quantum computers will be required to create entanglement if they are to realize significant advantages over classical computers, meaning that the generation of entanglement is an important question. First, we will discuss the implications of the Lieb-Robinson bound on graph descriptions of quantum computer architectures, and how the relevant graph parameter (diameter) compares to likely cost functions for architectures, such as maximum graph degree and total number of necessary connections. We will present a proposed graph architecture, the hierarchical product, which we believe provides excellent balance between these considerations. We will then introduce new methods of evaluating graphs that allow us to include quantum architectures capable of measurement and feedback operations. After doing so, we will show that the generation of entanglement entropy becomes a limit on computation. We will show that, for several possible physical models of computation, the generation of entanglement can be bounded by simple graph properties. We demonstrate a connection between worst-case scenarios for entanglement generation and a graph quantity called the Cheeger constant or isoperimetric number, which we evaluate for several proposed quantum computing architectures. Finally, we will look at the scenario of quantum sensing. In particular, we will examine protocols for quantum function estimation, where quantum sensors are available to measure all of the inputs to the function. We will demonstrate that entangled sensors are more capable than non-entangled ones by first deriving a new lower bound on measurement error and then presenting protocols that saturate these bounds. We will first do so for linear functions of the measured quantities and then extend this to general functions using a two-step linearizing protocol.

•Jan 1, 2019•1 citation

Entanglement and Quantum Computation

Richard Jozsa

We argue that entanglement is the essential non-classical ingredient which provides the computational speed-up in quantum algorithms as compared to algorithms based on the processes of classical physics.

arXiv:quant-ph/9707034•Jul 17, 1997•86 citations

An Intelligent Hybrid Cryptographic Security Framework: Leveraging Artificial Intelligence to Defend Critical Systems Against Next-Generation Quantum Computing Attacks

Gulshan Verma

Quantum computing advances rapidly and brings significant risks to traditional methods of encrypting data. As a result, new and innovative methods must be designed to provide advanced security techniques that will defend against both classical and quantum-based attacks. This work explores an AI-assisted hybrid cryptographic architecture (HCA) that combines traditional encryption, post-quantum methods of data encryption, and artificial intelligence to create a more secure system than offered by any of the individual methods alone. The HCA uses Algorithm 1, which applies an adaptive key management and threat detection protocol utilizing classical and lattice-based cryptographic techniques to create a unified hybrid key that provides dual layers of security. The HCA uses AI-assisted anomaly detection to monitor system functions, identify threats, and adjust security models accordingly. The HCA employs efficient key creation, encrypting, and decrypting processes with lower computational requirements and optimized resource usage. The performance of the HCA is evaluated against several performance metrics consisting of security level, computational complexity, total memory utilized, energy consumed, scalability, accuracy of detection, and false positive rate. The performance metrics demonstrate that the HCA significantly outperforms existing methods by achieving higher levels of security, shorter amounts of time to process information, and greater quality of detection while generating fewer false positives. The integration of AI into the HCA allows for greater adaptation to new and evolving cyber threats to respond in real time.As confirmed by both tables and graphical diagrams, the framework's proposed solution successfully balances security, efficiency, and scalability. This places it in a position to be used in today's climate of modern technologies (cloud computing, IoT networks, and secure communications). Overall, this study offers an effective and future-oriented way to deal with the obstacles of cyberspace security presented by quantum computing.

INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT•Apr 1, 2026•0 citations
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to evaluate the hierarchical architecture proposed by A. Bapat et al. [Phys. Rev. A 98, 062328 (2018)] and find it to be a promising alternative to the conventional grid architecture. We also show that the lower bound that this metric places on the creation time of highly entangled states can be saturated with a constructive protocol, up to a factor logarithmic in the number of qubits.
Benchmarking is how the performance of a computing system is determined. Surprisingly, even for classical computers this is not a straightforward process. One must choose the appropriate benchmark and metrics to extract meaningful results. Different benchmarks test the system in different ways, and each individual metric may or may not be of interest. Choosing the appropriate approach is tricky. The situation is even more open ended for quantum computers, where there is a wider range of hardware, fewer established guidelines, and additional complicating factors. Notably, quantum noise significantly impacts performance and is difficult to model accurately. Here, we discuss benchmarking of quantum computers from a computer architecture perspective and provide numerical simulations highlighting challenges that suggest caution.
In this thesis, we focus on the questions of how quantum entanglement can be generated between two or more spatially separated systems and, once generated, how it can be applied in quantum technology. First we will discuss a protocol, which we conjecture to be optimal in some regimes, that quickly creates entangled states across long distances in systems with power-law interactions. We will discuss how this protocol compares with currently known bounds on entangled state generation and how it might be implemented in a three-dimensional lattice of Rydberg atoms. Next, we will turn our attention to more general questions of how the Lieb-Robinson bound and other limitations on entanglement can be used to inform the design of quantum computers. Quantum computers will be required to create entanglement if they are to realize significant advantages over classical computers, meaning that the generation of entanglement is an important question. First, we will discuss the implications of the Lieb-Robinson bound on graph descriptions of quantum computer architectures, and how the relevant graph parameter (diameter) compares to likely cost functions for architectures, such as maximum graph degree and total number of necessary connections. We will present a proposed graph architecture, the hierarchical product, which we believe provides excellent balance between these considerations. We will then introduce new methods of evaluating graphs that allow us to include quantum architectures capable of measurement and feedback operations. After doing so, we will show that the generation of entanglement entropy becomes a limit on computation. We will show that, for several possible physical models of computation, the generation of entanglement can be bounded by simple graph properties. We demonstrate a connection between worst-case scenarios for entanglement generation and a graph quantity called the Cheeger constant or isoperimetric number, which we evaluate for several proposed quantum computing architectures. Finally, we will look at the scenario of quantum sensing. In particular, we will examine protocols for quantum function estimation, where quantum sensors are available to measure all of the inputs to the function. We will demonstrate that entangled sensors are more capable than non-entangled ones by first deriving a new lower bound on measurement error and then presenting protocols that saturate these bounds. We will first do so for linear functions of the measured quantities and then extend this to general functions using a two-step linearizing protocol.
Quantum computing advances rapidly and brings significant risks to traditional methods of encrypting data. As a result, new and innovative methods must be designed to provide advanced security techniques that will defend against both classical and quantum-based attacks. This work explores an AI-assisted hybrid cryptographic architecture (HCA) that combines traditional encryption, post-quantum methods of data encryption, and artificial intelligence to create a more secure system than offered by any of the individual methods alone. The HCA uses Algorithm 1, which applies an adaptive key management and threat detection protocol utilizing classical and lattice-based cryptographic techniques to create a unified hybrid key that provides dual layers of security. The HCA uses AI-assisted anomaly detection to monitor system functions, identify threats, and adjust security models accordingly. The HCA employs efficient key creation, encrypting, and decrypting processes with lower computational requirements and optimized resource usage. The performance of the HCA is evaluated against several performance metrics consisting of security level, computational complexity, total memory utilized, energy consumed, scalability, accuracy of detection, and false positive rate. The performance metrics demonstrate that the HCA significantly outperforms existing methods by achieving higher levels of security, shorter amounts of time to process information, and greater quality of detection while generating fewer false positives. The integration of AI into the HCA allows for greater adaptation to new and evolving cyber threats to respond in real time.As confirmed by both tables and graphical diagrams, the framework's proposed solution successfully balances security, efficiency, and scalability. This places it in a position to be used in today's climate of modern technologies (cloud computing, IoT networks, and secure communications). Overall, this study offers an effective and future-oriented way to deal with the obstacles of cyberspace security presented by quantum computing.