Finding maximal quantum resources
arXiv:2210.13475 · doi:10.1103/PhysRevA.110.062428
Abstract
For many applications the presence of a quantum advantage crucially depends on the availability of resourceful states. Although the resource typically depends on the particular task, in the context of multipartite systems entangled quantum states are often regarded as resourceful. We propose an algorithmic method to find maximally resourceful states of several particles for various applications and quantifiers. We discuss in detail the case of the geometric measure, identifying physically interesting states and delivering insights to the problem of absolutely maximally entangled states. Moreover, we demonstrate the universality of our approach by applying it to maximally entangled subspaces, the Schmidt-rank, the stabilizer rank as well as the preparability in triangle networks.
arXiv comment19 pages, 9 figures. v3: final version
References in corpus (71)
- The Quantum Internet
- Quantum cryptography: Public key distribution and coin tossing
- Three qubits can be entangled in two inequivalent ways
- Efficient classical simulation of slightly entangled quantum computations
- Measurement-based quantum computation with cluster states
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Entanglement Measures and Purification Procedures
- Multi-party entanglement in graph states
- A Theory of Fault-Tolerant Quantum Computation
- A high-bias, low-variance introduction to Machine Learning for physicists
- Matrix product states represent ground states faithfully
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- Entanglement monotones
- Robustness of entanglement
- Advances in High Dimensional Quantum Entanglement
- Fidelity and Concurrence of conjugated states
- Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
- Methodology for quantum logic gate constructions
- Hudson's Theorem for finite-dimensional quantum systems
- Trading classical and quantum computational resources
- Most quantum states are too entangled to be useful as computational resources
- Bell inequality, Bell states and maximally entangled states for n qubits
- The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
- Monotones and invariants for multi-particle quantum states
- Implementation of the Five Qubit Error Correction Benchmark
- How entangled can two couples get?
- Maximally multipartite entangled states
- Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication
- Estimating entanglement measures in experiments
- Absolutely maximally entangled states of seven qubits do not exist
- Counterexample to an additivity conjecture for output purity of quantum channels
- Channel Capacities versus Entanglement Measures in Multiparty Quantum States
- Multiqubit symmetric states with high geometric entanglement
- The maximally entangled symmetric state in terms of the geometric measure
- Are random pure states useful for quantum computation?
- All Maximally Entangled Four Qubits States
- Generalized Euler Angle Paramterization for SU(N)
- Entanglement of multiparty stabilizer, symmetric, and antisymmetric states
- Quantifying Quantumness and the Quest for Queens of Quantum
- Entanglement and quantum combinatorial designs
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Fundamentals of universality in one-way quantum computation
- Experimentally friendly geometrical criteria for entanglement
- Multipartite entanglement detection via structure factors
- Tripartite entanglement transformations and tensor rank
- Random unistochastic matrices
- Visualizing elusive phase transitions with geometric entanglement
- Geometric measure of entanglement for pure multipartite states
- Quantum entanglement in the triangle network
- Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem
- Characterizing Genuine Multilevel Entanglement
- A recursive parameterisation of unitary matrices
- Necessary and sufficient conditions for local manipulation of multipartite pure quantum states
- Maximally entangled three-qubit states via geometric measure of entanglement
- Improved upper bounds on the stabilizer rank of magic states
- From unextendible product bases to genuinely entangled subspaces
- A composite parameterization of unitary groups, density matrices and subspaces
- The Tensor Rank of the Tripartite State }
- Matrix permanent and quantum entanglement of permutation invariant states
- Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
- How entangled can a multi-party system possibly be?
- Easy implementable algorithm for the geometric measure of entanglement
- Approximation algorithms for QMA-complete problems
- Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States
- Numerical construction of multipartite entanglement witnesses
- Direct evaluation of pure graph state entanglement
- Connections of geometric measure of entanglement of pure symmetric states to quantum state estimation
- An algorithm to explore entanglement in small systems
- Geometric entanglement and quantum phase transitions in two-dimensional quantum lattice models
- Topological Minimally Entangled States via Geometric Measure
- Geometric Entanglement and Quantum Phase Transition in Generalized Cluster-XY models