Preservation of entanglement in local noisy channels

Ghosh, Priya; Sen, Kornikar; Sen, Ujjwal

doi:10.1103/physreva.110.022419

Phys. Rev. A

2024

DOI: 10.1103/physreva.110.022419

|View full text |Cite

Preservation of entanglement in local noisy channels

Priya Ghosh,

Kornikar Sen,

Ujjwal Sen

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor networks

Niedermeier,

Lado,

Flindt

2024

Phys. Rev. Research

View full text Add to dashboard Cite

Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time evolution is perfectly unitary and that the full Hilbert space is available. However, in practice, the available entanglement may be limited, leading to a reduced fidelity of the quantum algorithms. To simulate the execution of quantum algorithms with limited entanglement, tensor-network methods provide a useful framework, since they allow us to restrict the entanglement in a quantum circuit. Thus, we here use tensor networks to analyze the fidelity of the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm as the entanglement is reduced, and we map out the entanglement that is generated during the execution of each algorithm. In all three cases, we find that the algorithms can be executed with high fidelity even if the entanglement is somewhat reduced. For example, the quantum counting algorithm can be executed with a high fidelity beyond a certain threshold level of entanglement. Our results provide an understanding of the entanglement that is required to execute the three algorithms, and our simulations based on tensor networks can easily be applied to other algorithms. Published by the American Physical Society 2024

show abstract

Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor networks

Niedermeier,

Lado,

Flindt

2024

Phys. Rev. Research

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Preservation of entanglement in local noisy channels

Cited by 1 publication

References 65 publications

Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor networks

Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor networks

Contact Info

Product

Resources

About