Near-term Efficient Quantum Algorithms for Entanglement Analysis
Quantum circuit
DOI:
10.48550/arxiv.2109.10785
Publication Date:
2021-01-01
AUTHORS (3)
ABSTRACT
Entanglement plays a crucial role in quantum physics and is the key resource information processing. However, entanglement detection quantification are believed to be hard due operational impracticality of existing methods. This work proposes three near-term efficient algorithms exploiting hybrid quantum-classical technique address this difficulty. The first algorithm finds Schmidt decomposition--a powerful tool analyze properties structure entanglement--for bipartite pure states. While logarithm negativity can calculated from decomposition, we propose second estimate for states, where width parameterized circuits further reduced. Finally, generalize our framework mixed leading third which detects on specific families determines disdillability general. All share similar optimizations accomplished by maximizing cost function utilizing local circuits, with better hardware efficiency practicality compared experimental implementation Quantum Leaf using IoP CAS superconducting processor exhibits validity methods analyzing quantifying devices.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....