{'fraction_non_alphanumeric': 0.03807908006974881, 'fraction_numerical': 0.009095621848343467, 'mean_word_length': 4.313509452860899, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 9, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 5, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Accessible bounds for general quantum resources

The recent development of general quantum resource theories has given a sound basis for the quantification of useful quantum effects. Nevertheless, the evaluation of a resource measure can be highly non-trivial, involving an optimisation that is often intractable analytically or intensive numerically. In this paper, we describe a general framework that provides quantitative lower bounds to any resource quantifier that satisfies the essential property of monotonicity under the corresponding set of free operations. Our framework relies on projecting all quantum states onto a restricted subset using a fixed resource non-increasing operation. The resources of the resultant family can then be evaluated using a simplified optimisation, with the result providing lower bounds on the resource contents of any state. This approach also reduces the experimental overhead, requiring only the relevant statistics of the restricted family of states. We illustrate the application of our framework by focusing on the resource of multiqubit entanglement and outline applications to other quantum resources.


Introduction
Quantum resource theories provide a rigorous structure to characterise the resources present in quantum systems [1][2][3][4][5]. Such resources arise whenever there is a restriction imposed on the available operations that an agent can perform on the quantum system, identifying a set of free operations O which form a subset of the completely positive and trace preserving linear maps [6]. The restriction also identifies a set of free states F , forming the largest subset of the set D(H) of quantum states for which any pair of states can be reversibly converted using free operations alone. Any non-free state is hence a resource state, since one must always input resource in the form of a non-free operation to create such a state from a free state.
An important question is to consider how much resource is present in a given state. The free operations allow for a qualitative characterisation: a state ρ is more resourceful than another state σ if there exists a free operation Λ ∈ O so that σ = Λ(ρ), meaning that the state σ can be prepared from ρ without consuming any resource. Such a characterisation can result in a complicated multibranch hierarchy [39,40], where it can be difficult to identify necessary and sufficient conditions for interconvertibility between two resource states [6,[41][42][43][44][45].
However, quantum resource theories also provide the structure to quantitatively measure the resource content of a state [5,9,18,20,46]. Here, the complicated multibranch hierarchy can be condensed into a single quantitative ordering that preserves the hierarchy within each branch. Since there is not a unique way to impose a quantitative ordering, there is no unique measure of the resources present in a quantum system. Although this may appear counterintuitive, one may reconcile the non-uniqueness of resource measures from an operational perspective: we expect to exploit our quantum resource for a variety of different tasks, for which each task may value certain resource states over others and hence impose a different ordering.
Any bona fide measure R of a quantum resource must have compatibility with the corresponding quantum resource theory by satisfying two universal requirements. First, it must hold that R(ρ) 0 for all ρ ∈ D(H) and R(ρ) = 0 for all ρ ∈ F , i.e. that a resource measure is in general non-negative and always zero when there is no resource. Second, it must hold that R(Λ(ρ)) R(ρ) for all ρ ∈ D(H) and Λ ∈ O. This requirement is known as resource monotonicity, and imposes that resource measures should preserve the hierarchy within each branch. Additional properties may also be considered for a given resource, such as strong monotonicity [8] or convexity whenever F is convex (see e.g. [9,46] for comprehensive accounts of the requirements for measures of entanglement).
When a bona fide resource measure is selected, one is then presented with the task of evaluating the measure for arbitrary states. This task is typically intractable analytically and difficult numerically, often resulting in strong restrictions on the applicability of the resource measure. For example, consider the non-trivial optimisations given by the distance-based resource measures where D δ is a contractive distance on the set of quantum states [9,47,48], as well as by the (generalised) resource robustness [5,[49][50][51][52][53] which quantifies the resilience of a resource state ρ against mixing.
In this paper, we construct a general framework to calculate simplified lower bounds to bona fide resource measures. We begin in section 2 by introducing two of the foundational concepts for our framework: the resource non-increasing projections and the corresponding resource guarantor states, both of which can have wider relevance to quantum resource theory. In section 3, we detail the four main steps of our framework. Our approach is not restricted to specific types of resource, since it relies on general concepts using the structure of resource theories. Nevertheless, to verify the usability of our framework, we provide example applications in section 4, focusing in particular on the resource of multiqubit entanglement. Here we first provide a method for constructing entanglement non-increasing projections and identifying their corresponding entanglement guarantor states. By using this construction we define a new family of entanglement guarantor states complementing those highlighed in [54], and proceed to evaluate the robustness of multiqubit entanglement on these states, which can in turn be used to lower bound the robustness of the GHZ state. Finally, we conclude and discuss our findings in section 5.

Resource non-increasing projections and resource guarantor states
We now introduce the two main foundations of our framework. A quantum operation Π that satisfies the composition relation Π 2 = Π is referred to as a projection 1 . We define the resource non-increasing projections (RNIPs) to be the subset of projections that are also free. Every such Π ∈ O identifies a corresponding set of resource guarantor states (RGSs) G given by all the states left invariant by Π, i.e.
It can then be seen that the action of Π on the set of quantum states D(H) is to project every state onto the set of resource guarantor states, so that Hence, for every ρ ∈ D(H) there is a corresponding RGS Π(ρ) ∈ G. Now, for any bona fide measure of a resource R we know that which holds since R satisfies the resource monotonicity requirement. It can therefore be seen that the state Π(ρ) ∈ G provides a quantitative guarantee on the resources of ρ ∈ D(H) in terms of a lower bound. Figure 1 illustrates the action of RNIPs and the corresponding set of RGSs. We remark that there is generally a many-to-one correspondence between a general state ρ ∈ D(H) and the corresponding RGS Π(ρ) ∈ G. Furthermore, RNIPs present a generalisation of the resource destroying maps introduced in [35], which are an extremal form of RNIPs that destroy all resource, as their RGSs are free states. In general, since Π ∈ O, we know that the action of Π on the set of free states σ ∈ F is to map it to a subset F G of free RGSs, i.e. the intersection between F and G . We have that We see in the following that our framework allows for a simplification in the evaluation of resource measures by replacing optimisation over all free states F with an optimisation over the free RGSs F G ⊂ F , which are typically simpler to characterise. 1 Here we restrict to quantum operations that preserve the dimension of the quantum system.

Framework
We now specify the general framework for providing lower bounds to bona fide resource measures for arbitrary quantum states. Our framework consists of four steps.
Step one: identify an RNIP Π and characterise the corresponding set of RGSs G .
Step two: characterise the set F G of free RGSs.
Step three: evaluate R( ) for all ∈ G.
Each step is now explained in detail. An illustration of the framework is provided in figure 2 and an example of its application to the resource of multiqubit entanglement can be found in section 4.
The first step is to identify an RNIP and characterise the corresponding RGSs. This step requires attention to two objectives: on the one hand it is desirable for the RGSs and free RGSs to be simple to characterise, so that R( ) can be evaluated for any ∈ G. On the other hand, one does not want to pick an RNIP that destroys a lot of resource, as the resultant lower bound in equation (5) becomes less informative. Indeed, it is possible for Π(ρ) ∈ F G even if ρ / ∈ F , so that the corresponding lower bound is trivial. This is seen in the extreme for the resource destroying maps [35], for which Π(ρ) ∈ F G for all ρ ∈ D(H).
The second step consists of characterising the set F G of free RGSs, i.e. the intersection between F and G . This can be achieved using equation (6), which tells us that F G is simply the result of applying the chosen RNIP onto the set of free states F .
In the third step of the framework, we evaluate a chosen resource measure R( ) on the set of RGSs, i.e. for all ∈ G. Typically, the evaluation of R( ) for ∈ G is much more affordable than the evaluation of R(ρ) for ρ ∈ D(H), since one can employ a number of tricks to simplify the optimisation. For example, consider the distance-based resource measures in equation (1). It can be seen that for any ∈ G Figure 1. The action of a resource non-increasing projection (RNIP) Π, which satisfies Π 2 = Π ∈ O, is to project the set of states D(H) onto the set of resource guarantor states (RGSs) G (dashed orange ellipse). Any state ρ ∈ D(H) has a corresponding RGS Π(ρ) ∈ G (orange circle), with a many-to-one correspondence between general states and RGSs (dotted orange area). The intersection between free states F (solid blue ellipse) and RGSs G is the set of free RGSs F G , so that every free state σ ∈ F is transformed into a corresponding free RGS Π(σ) ∈ F G .
where in the second equality we use the contractivity of the distance D δ under any quantum operation, while in the third equality use equation (6) and the fact that Π( ) = . This equation means that the distance-based resources of ∈ G are given simply by the distance to the free RGSs.
Alternatively, consider the resource robustness in equation (2). Whenever we consider an RGS ∈ G, for every mixture +sτ 1+s ∈ F with τ ∈ D(H), there is a corresponding mixture +sΠ(τ ) 1+s ∈ F G . Hence, it holds that so that one needs only to consider mixtures of ϖ with other RGSs to obtain a free RGS. We note that equation (8) is a convex optimisation problem whenever G and F G are convex sets, and that equation (8) may be evaluated as the solution of a semidefinite program [52,55] if G and F G can additionally be characterised with a finite number of linear matrix inequalities. This can be the case even when equation (2) cannot be posed as the solution to a semidefinite program, as we see for the example in section 4 of multiqubit entanglement. The final step of our framework is to provide a lower bound to the resource degree of any state ρ ∈ D(H), according to equation (5), by considering the corresponding RGS Π(ρ) ∈ G. However, this lower bound may be optimised over free unitaries: the unitary transformations A zoom-in onto the set G of RGSs illustrates the four steps of our framework. The first two steps consist of fixing an RNIP Π and finding the sets of RNGs G (dashed orange ellipse) and free RNGs F G (given by the intersection with the solid blue ellipse). In the third step, we use the characterisations of G and F G to evaluate a chosen resource measure R( ) for any RGS ∈ G (illustrated here for the distance-based measures in equation (7)). Finally, the fourth step involves considering the optimised lower bound max U R(Π(U(ρ))) R(ρ) over all free unitary operations U ∈ O, with the set Π(U(ρ)) ∈ G of RGSs illustrated by the orange ellipse.
Indeed, it is straightforward to see that R(ρ) = R(U(ρ)) for any monotonic resource measure, so that R(Π(U(ρ))) R(U (ρ)) = R(ρ). (9) Evaluating the maximum of the left hand side of the above equation over all free unitary operations U ∈ O hence provides an optimised lower bound to the resource contents of ρ ∈ D(H). Nevertheless, the set of free unitaries may not always be fully characterised for a given resource, while optimisation over the free unitaries can be computationally intensive. It can thus be more realistic to optimise over a well characterised subset of free unitaries. As we see in the following, the free unitaries of multiqubit entanglement are local qubit unitaries.
Performing an optimisation over the SU (2) group is often simple to solve, with some cases amenable to evaluation as the result of a semidefinite program. These four steps compose the main structure of our framework. Whilst step one and step four have already been employed for the resource of entanglement [56][57][58][59], our primary contrib ution here is formalising the framework for general resources, as well as highlighting the simplifications possible in evaluating resource measures by restricting to what we have defined as RGSs, see equations (7) and (8).
It is also important to comment on the experimental applicability of our result. One approach to quantify the resource of a state prepared in the laboratory is to perform a full state tomography [6,60,61], requiring an exponential number of measurement settings (with respect to system dimension) in the worst-case scenario, although a less intensive overhead can be achieved by restricting to low rank states [62]. Alternatively, one can reconstruct the corresponding RGS, which may require much fewer measurement settings to achieve. For example, in the following section we discuss a family of RGSs that are experimentally accessible using only three local measurement settings. Moreover, the optimisation over free unitaries U ∈ O in the fourth step of our framework can be attempted experimentally whenever partial prior knowledge of the target state is available, as is the case in most scenarios. Here, one performs a change of basis before the measurement according to the optimal free unitary of the target state.

Applications of the framework
The framework naturally lends itself to the characterisation of a variety of quantum resources. We first briefly discuss some very natural example applications for thermodynamics and quant um coherence, before proceeding to give a detailed example of applying our framework to multiqubit entanglement.
Our first example, the resource theory of thermodynamics (or athermality) [15,30], identifies a unique free state-the thermal state of a given Hamiltonian H at a fixed temperatureand the free operations as those which can be implemented by attaching a thermal ancilla and applying a unitary operation which commutes with the total Hamiltonian of the system. Here, one can consider as a resource non-increasing projection the completely dephasing map This greatly simplifies the evaluation of resource measures, since the resultant states are simply classical probability distributions, and indeed the problem of computing distance-based resource measures reduces to optimising distances between probability distributions. Such projections have already found use in the description of operational tasks in this resource theory [15,63,64].
Another example is quantum coherence, which captures the existence of a quantum system in a superposition of states with respect to a given reference basis, and has relevance in fundamental information processing tasks, metrology, and quantum biology, as well as being a crucial ingredient for the creation of entanglement [18]. The coherence-free states, or incoherent states, can be identified as diagonal when represented in the reference basis {|i }, while the free operations can be identified as incoherent operations [17]. Any projective measurement on subspaces spanned by vectors of the reference basis, representing a decohering map which zeroes some off-diagonal elements of the density matrix, is then a resource non-increasing projection. Identifying particular instances of this type of projection will then provide varying lower bounds for coherent states. Another type of an RNIP which has been employed in the resource theory of coherence is an operation reducing all two-qubit states to so-called M 3 N states [65], which we will also encounter in section 4.3. We now provide a more in-depth analysis of the application of our framework to the resource theory of multiqubit entanglement-a fundamental resource of paramount importance in quantum information [8], although quantitatively very difficult to characterise. We begin by outlining the background details of multiqubit entanglement and then proceed to discuss a general method to construct entanglement non-increasing projections and find their corresponding entanglement guarantor states. This construction is used to identify the EG N states, which we then use within our framework.

Resource theory of multiqubit entanglement
Within the quantum resource theory of multiqubit entanglement, there exists a hierarchy of free states referred to as M -separable states, with 2 M N . These states can be written as convex combinations of product states, each of which is factorised with respect to any (possibly different) partition of the N qubits into M subsystems, i.e.
where |ψ The free operations are instead given by the single-qubit LOCC, whereby only operations that are local on each of the N qubits are permitted, along with classical communication [66]. An important instance of single-qubit LOCC is a convex combination of single-qubit local unitaries, whose action on a state ρ is given by It requires only one-way communication and can be physically achieved by allowing one of the qubit parties, e.g. the αth one, to randomly select a local unitary U (α) i by using the probability distribution {p i } and then to communicate the result to all the other parties.
Having identified the free states and free operations, we can define a bona fide measure E M of M-inseparable multiqubit entanglement to be any function satisfying the requirements discussed in section 1. In particular, the distance-based measures E D δ M are specified by equation (1) and the entanglement robustness is specified by equation (2).

Constructing entanglement non-increasing projections
We now introduce a systematic way to build multiqubit entanglement non-increasing projections (ENIPs) and, as a consequence, the corresponding entanglement guarantor states (EGSs). First of all, let us give a shorthand notation for the Bloch representation of a generic N-qubit state ρ in the computational basis {|0 , |1 } ⊗N : where the set I N = {0, 1, 2, 3} N contains all the N-tuples α = (α 1 , α 2 , · · · , α N ) of indices ranging from 0 to 3, P α = σ α1 ⊗ σ α2 ⊗ · · · ⊗ σ αN , with σ 0 = I being the 2 × 2 identity matrix and σ 1 , σ 2 , σ 3 the Pauli matrices, and T ρ α = Tr(ρP α ) are the so-called correlation tensor elements of ρ. The single-qubit (Hermitian) local unitaries P α satisfy several properties that will be extremely useful in the following, see appendix A for further details. Now we provide a systematic way to project, via single-qubit LOCC, an arbitrary state ρ onto an EGS of the following form: for some instances of G ⊂ I N . This ENIP consists of putting equal to zero all the correlation tensor elements T ρ α of ρ such that α / ∈ G and leaving alone the remaining ones. The number of surviving correlation tensor elements T ρ α is given by the cardinality |G| of the set G. One may pick G so that |G| is small, leading to a reduction in the complexity of evaluating the multiqubit entanglement of ρ as well as a decreased overhead in the number of local measurement settings required to recover ρ in laboratory. However, |G| can be large and still tractable, e.g. for the entanglement robustness whenever ρ and the corresponding free states can be described with a finite number of linear matrix inequalities.
One approach to performing the above ENIP is to apply to ρ the following convex combination of single-qubit local unitaries (which is a single-qubit LOCC as we have previously mentioned): where J G ⊂ I N is defined in such a way that This ENIP is successful, i.e. so that Π G (ρ) can always be written as in equation (13), provided that the matrices P β for which β ∈ J G form a set that can be written as for some family of matrices Indeed, by using the properties discussed in appendix A, one can easily see that where ρ is defined in equation (13). This is due to the fact that for any α ∈ I N where the first and second lines are due to the linearity and cyclicity of the trace, respectively, the third line is due to the fact that and finally the sixth line is due to the fact that |J + G (α)| = |J G | when α ∈ G while |J + G (α)| = |J G |/2 otherwise, which in turn is due to equation (15) and the assumption that the matrices P β for which β ∈ J G form a set of the form given in equation (16) for some family of matrices {P αi } n i=1 . An alternative implementation of the above described ENIP can be realised by resorting to the following sequential approach. We begin by considering the n single-qubit local unitaries {P αi } n i=1 . Then, we fix a sequence of states {ρ i } n i=0 defined recursively by for i ∈ {1, 2, . . . n}. This can be achieved physically in each step by having one of the qubit parties flip a coin and classically communicate the result to all the other qubits, with the result of the flip deciding whether the single-qubit local unitary P αi−1 is applied or not. Then, by setting ρ 0 = ρ we can easily see that where the matrices P β i are defined in equation (16). We show in the following a particular realisation of this method for constructing an ENIP for any number of qubits N, and hence see how it can be used as a tool within our framework. The identification of alternative ENIPs may proceed by first fixing N and choosing a G ⊂ I N , perhaps based on experimental or physical considerations. One then searches for a family of matrices {P αi } n i=1 so that equations (15) and (16) hold. If such a family can be found, then the resultant matrices {P β i } 2 n i=1 in equation (16) define a J G that can be used to construct the ENIP according to equation (14). Generally, identifying a valid G and J G can be a difficult task.
Nevertheless, it is a process that can be easily automated for small numbers of qubits, where the quantification of multiqubit entanglement still remains an open and relevant problem.

Applying the framework
We are now ready to apply the four-step framework introduced in section 3 to the resource theory of multiqubit entanglement. One realisation of this framework has already been achieved in [54] by considering a fixed ENIP with corresponding EGSs given by the so-called M 3 states with all maximally mixed marginals), with the c i ∈ R constrained so that ω is positive semidefinite. In the following we will introduce another realisation of our framework based on the so-called EG N states. As we shall see, the EG N states allow us to derive lower bounds on multiqubit entanglement that are complementary to those provided by the M 3 N states. The steps of our framework for EG N states are now explained.
Step one: identify an ENIP and characterise the corresponding set of EGSs.
In this step we can use the previously discussed method to construct ENIPs and find the corresponding EGSs. By resorting to the following 2(N − 1) local unitaries when N 3 and to when N = 2, as well as to the recursive procedure introduced in equation (20), we identify an ENIP and obtain the family of N-qubit EGSs whose matrix representation in the computational basis is given by: . These states will be referred to as EG N states and will be denoted in the following also by the triple {d 1 , d 2 , d 3 }. The characterisation of the EG N states is manifestly different between the odd and even N case. In the {d 1 figure 3. This tetrahedron is constructed simply by imposing the non-negativity of the four unique eigenvalues of ϖ, see appendix B. Similarly, for even N the set of EG N states is given in the {d 1 , d 2 , d 3 }-space by the unit ball B 1 centred into the origin.
Step two: characterise the set of free EGSs.
We now discuss the set S EGN M of M-separable EG N states for any 2 M N . This set can be characterised as the result of applying the fixed ENIP specified in equations (20)- (22) onto the general set of M-separable states given in equation (10), see appendix C for further details. We see that when M > N/2 + 1 the M-separable EG N states are such that |d 1 | + |d 2 | + |d 3  It is immediate to see that E M ( ) = 0 for all ∈ EG N whenever M N/2 + 1. Therefore, one cannot use the EG N states to provide non-trivial lower bounds on multiqubit entanglement for such M. We instead focus on the cases M > N/2 + 1, where the M-separable states always form the unit octahedron as a strict subset of all EG N states. Let us first consider the distance-based measures of M-inseparable multiqubit entanglement, where equation (7) shows that we simply need to find the minimal distance from ϖ to the set of EG N states inside the unit octahedron O 1 . In the odd N > 1 case, since all the EG N states are diagonal in the same basis (appendix B), we have that distances between them reduce to the corresponding classical distance between the probability distributions formed by their eigenvalues. What is more, since the eigenvalues of the EG N states with odd N > 1 are equivalent to the eigenvalues of the M 3 N states with even N, it happens that the ensuing optimisation problem of classical information geometry has already been solved in [54]. The result is that, for any choice of distance, the closest M-separable EG N state to ϖ is on the nearest surface of the unit octahedron, with the location specified by the intersection with the extended line connecting ϖ to its corresponding nearest vertex, see ⊗ I form a triple of anticommuting matrices, one can easily see that the trace distance between any two EG N states with even N reduces to (half) the Euclidean distance between their corresponding triples, as is also the case for the M 3 N states with odd N [54]. This means that the trace distancebased measure of M-inseparable multiqubit entanglement for ϖ is simply the Euclidean distance from its triple to the unit octahedron. We now prove that the analytical expression of the robustness of M-inseparable multiqubit entanglement E R M ( ) of an arbitrary EG N state ϖ for any odd N > 1 is the following: To do this, given an EG N state ϖ and taking into account equation (8), we need to solve the following simplified optimisation (which can easily be posed as a semidefinite program [51]) i.e. we need to find the smallest positive s such that σ = +sτ 1+s is an M-separable EG N state and τ is any EG N state. In other words, we need to prove that s = h is the smallest positive s for which σ = +sτ 1+s is represented in the {d 1 , d 2 , d 3 }-space by a point belonging to the unit octahedron O 1 , and τ by any point in the tetrahedron T (−1) (N−1)/2 , provided that h 0 and M N/2 + 1, which are the only nontrivial cases where ϖ is not M-separable. In the following we will assume without loss of generality that ϖ belongs to the corner containing the vertex {(−1) (N−1)/2 , (−1) (N−1)/2 , (−1) (N−1)/2 }, since all the EG N states belonging to the other three corners can be obtained from this by simply applying a single-qubit local unitary σ i ⊗ I ⊗N−1 , i ∈ {1, 2, 3}, under which any sort of multiqubit entanglement is invariant. The optimisation in equation (25) can be solved simply by using the fact that the optimal τ must be as far from ϖ as possible and is hence represented by a point on the base of the tetrahedron T (−1) (N−1)/2 with respect to ϖ, i.e. given by a triple {e 1 , e 2 , e 3 } satisfying shown as the shaded red region in figure 3. For a given τ satisfying this condition, one can then easily see that the optimal σ lies on the intersection of the line connecting τ and ϖ (given by the convex combination σ = +sτ 1+s for s 0) with the face of the unit octahedron O 1 closest to ϖ, given by any triple {s 1 , s 2 , s 3 } satisfying Figure 3. The geometry of EG N states for odd N and M > N/2 + 1, together with example choices of optimal states σ, τ for the generalised robustness E R M ( ). The tetrahedron T (−1) (N−1)/2 can be seen to contain the M-separable octahedron O 1 (shaded blue). For any choice of ϖ, the closest M-separable states σ lie in the face of the octahedron closest to ϖ (shaded yellow), and the optimal τ lie in the base of the tetrahedron (shaded red). The particular choice of the optimal state σ is also the closest M-separable state with respect to any bona fide distance measure of entanglement. Instead, another optimal state σ can be seen to constitute a valid optimal choice for the standard robustness of M-inseparable entanglement since τ is also M-separable. see again figure 3 for an illustration. One then finds that s = h , which holds for any choice of τ on the base of the tetrahedron. It is hence clear that there is not a unique pair of τ ∈ EG N and σ ∈ S EGN M satisfying the infimum in equation (25). We have shown that one can in fact satisfy the infimum with any τ on the base of the tetrahedron furthest from ϖ and any σ on the face of the octahedron closest to ϖ, provided that they are colinear with ϖ itself. The optimal s is then given by the plane height h , as shown in equation (24). The non-uniqueness in the optimisation means that the infimum can even be satisfied by an M-separable τ sitting on the face of the octahedron O 1 furthest from ϖ. A consequence of this is that the robustness of M-inseparable multiqubit entanglement E R M ( ) of any EG N state ϖ coincides with the standard robustness, where the optimisation over τ in equation (25) is additionally restricted to M-separable states [49]. The standard robustness was previously calculated for two-qubit Bell-diagonal states in [67], which have an identical geometry to the odd N EG N states. It is also relevant to note that the robustness of M-inseparable multiqubit entanglement coincides with (twice) the trace distance-based measure E DTr M ( ) = h /2 for EG N states ϖ with odd N > 1 [54]. Intriguingly, the closest M-separable state to ϖ according to any contractive distance (such as the trace distance) is also a valid M-separable EG N state satisfying the optimisation for the robustness, see figure 3. Additionally, we note that the standard and generalised robustness provide, respectively, upper and lower bounds for a family of norms introduced in [5] which constitute measures of M-inseparable multiqubit entanglement generalising the greatest cross norm [68]. The fact that the two robustness quantifiers coincide in this case then implies that the multiqubit norms are also equal to them for all EG N states. These simplifications for EG N states highlight the wide scope of the applicability of our framework to different resource measures when one chooses a suitably simple class of RGSs.
We now consider optimising the lower bound provided through our framework to E M (ρ) for any state ρ by varying over single-qubit unitaries U ⊗ = N α=1 U (α) and considering the corresponding EG N state Π(U ⊗ ρU † ⊗ ), resulting in the maximised lower bound Experimentally, the optimised bound can be accessed by measuring a triple of correlations functions { d j } given by the expectation values of correspondingly rotated Pauli operators on each qubit, In table 1 we can see how useful our results are on the paradigmatic example of the N-qubit GHZ state [69] with N 3, which constitutes a primary resource for quantum computation and metrology [70]. See [54] for a comparison to results for M 3 N states. Here, due to the qubit permutation invariance of |GHZ (N) [54], optimisation of h can be achieved by setting all the single-qubit unitaries to be identical, i.e. U (α) = U 2 for all α. Here, U 2 can be parameterised by 3 angles {θ, ψ, φ} in the following way,

Discussion
Our general framework provides a clearcut approach to finding lower bounds to resource measures evaluated on arbitrary states. This framework is founded upon the hereby introduced concepts of resource non-increasing projections and the corresponding resource guarantor states. Each step in the framework is feasible to carry out. The first step can be performed by systematically identifying an RNIP, as we have shown in section 4.2, or by using intuition about the resource under consideration, as may be done for coherence. The second step can be realised by characterising the intersection between free states and RGSs, as we have shown in appendix C for multiqubit entanglement. The resultant optimisation in step three is necessarily simpler than for the corresponding arbitrary state due to the simplified structure of the RGS.
We have furthermore shown that the optimisation can be expressed as an SDP for the resource robustness and can hence be evaluated computationally with little overhead. Finally, varying over local unitaries in the fourth step can be a restricted optimisation over a constrained and/ or discrete set of candidates. Moreover, our framework is more experimentally friendly in the sense that it necessarily requires fewer measurements than a full state tomography. We illustrated the relevance of this framework for multiqubit entanglement by constructing a general accessible formalism to identify entanglement non-increasing projections and their resource guarantor states, giving a particular example of a projection that results in suitably defined EG N states. We then proceeded to complete the steps of our framework for this example, allowing us to find analytic lower bounds to the multiqubit entanglement of GHZ states that can be measured experimentally using only three local measurement settings.
Our approach can be understood as a particular type of quantitative resource witness [71,72], providing an approximation of the resources present in a system based on the results of a limited selection of measurement settings. It will be of further interest to compare the efficiency of lower bounds arising from our framework to those arising from other approaches, as has been done specifically for entanglement in [54]. Nevertheless, our framework relies on the universal concept of resource monotonicity, and can hence be applied in principle to a vast range of possible resource measures.
We have focused in this work on the provision of lower bounds to resource measures. These lower bounds are useful for verifying the minimum usefulness of a resource state. In practice, whenever a measure can be linked to the performance of an operational protocol, our lower bounds can be harnessed to guarantee a worst-case performance of using a given resource state. Nevertheless, evaluating upper bounds on relevant resource measures is also important, allowing for better comparison between resource states and hence a finer grained identification of states most useful in an operational setting. Our framework is geared towards providing lower bounds by contracting the state space using resource non-increasing projections. It will be of future interest to identify dual frameworks able to identify upper bounds for a given class of resource states.
By applying our framework to EG N states, we have been able to provide new results for evaluating the robustness of entanglement in both EG N states with odd N and M 3 N states with even N, complementing previous evaluations of the robustness of entanglement for two-qubit Bell diagonal states [67]. Our results show that the robustness coincides, for Bell diagonal states, with the plane height h , which equates the two-qubit concurrence and half the trace distance-based measure of entanglement. Our approach therefore allowed the evaluation of the robustness of entanglement, which is an NP-hard problem [73], to be simplified to an intuitive geometric optimisation for relevant classes of states. It is hoped that our framework will provide further simplifications when using alternative resource non-increasing projections.
Quantum resources embody the power behind presently developing quantum technologies. These technologies will require rigorous verification, through benchmarking, of the resources present in the employed devices. Our framework allows for a quantitative benchmark with a low overhead. Some of the next steps of our work could be to provide a variety of new lower bounds to resource measures stemming from different choices of projections. From an analytical perspective, it will be of interest to formalise whether a link exists between the strength of the projection (i.e. the amount of resource lost) and the simplicity of the corresponding family of resource guarantor states. Here it is expected that one necessarily loses a lot of resource by projecting onto a simple family. On the other hand, experimentally it will be interesting to harness our established lower bounds for concrete applications and proof-of-concept experiments to verify and quantify the resources present in complex quantum systems.

Appendix A. Properties of tensor products of Pauli matrices
For any α, β ∈ I N , it holds that P 2 α = I and that P α and P β can only either commute (i.e. [P α , P β ] = 0) or anti-commute (i.e. {P α , P β } = 0). More specifically, [P α , P β ] = 0 if there is an even number (including zero) of indices i ∈ {1, · · · , N} such that {σ αi , σ βi } = 0, whereas {P α , P β } = 0 otherwise. Moreover, given any set of matrices {P αi } n i=1 , we have that P α1 P α2 · · · P αn is equal to either ±P β or ±iP β for some β ∈ I N . In the following, with abuse of notation, we will denote any of the matrices ±P β or ±iP β simply by P β as their unitary transformation on any state ρ, i.e. P β ρP † β , provides exactly the same output. Finally, given an arbitrary matrix P α , we get that [P α , P α1 P α2 · · · P αn ] = 0 if P α anti-commutes with an even number (including zero) of matrices {P αi } n i=1 , while {P α , P α1 P α2 · · · P αn } = 0 otherwise. As a consequence, if one considers the following set composed of 2 n matrices: it happens that an arbitrary matrix P α can only either commute with all the above listed matrices P β i or commute with half of them and anti-commute with the remaining half.

Appendix B. Eigendecomposition of the EG N states
For odd N > 1, the EG N states are all diagonal in the following basis: with the corresponding eigenvalues given by: where i is the imaginary unit, j ∈ {1, · · · , 2 N−1 }, {|j } 2 N i=1 is the binary ordered N-qubit computational basis, while p and q are defined as For even N, the eigenvalues of the EG N states are given by as it can be easily shown by using the fact that in this case σ ⊗N−1 ⊗ I form a triple of anticommuting matrices.

Appendix C. Characterising the M-separable EG N states
Here we characterise the set S EGN M of M-separable EG N states for any 2 M N . We see that for M > N/2 + 1, all and only the M-separable EG N states satisfy |d 1 | + |d 2 | + |d 3  To prove this, it will be useful to introduce a notion of separability that depends on a particular partition of the composite system under consideration, as opposed to the already introduced notion of M-separability, which rather considers indiscriminately all the partitions with a set number M of parties. In order to characterise the possible partitions of an N-qubit system, we will employ the following notation [74]: • the positive integer M, 2 M N , representing the number of subsystems; • the set of positive integers {K α } M α=1 = {K 1 , K 2 , · · · , K M }, where a given K α represents the number of parties belonging to the αth subsystem; • the set of sequences of positive integers , · · · , N} and Q α ∩ Q α = ∅ for α = α , where a given sequence Q α represents precisely the parties belonging to the αth subsystem.
In the following, Q M := {Q α } M α=1 will denote a generic M-partition of an N-qubit system and we will assume without loss of generality that N ∈ Q M , i.e. the Nth qubit is always contained in the Mth subsystem. The separable states with respect to the M-partition Q M are then defined as states ς of the form where {p i } is a probability distribution and τ Moreover, we will also need to use the fact that, on one hand, the set of the triples {c 1 , c 2 , c 3 }, with c i = Tr(ρσ ⊗N i ), obtained by considering any possible N-qubit state ρ is [54] • the unit ball B 1 , when N is odd; • the tetrahedron T (−1) N/2 , when N is even.
On the other hand, as we have seen here, the set of the triples i,3 } corresponding to the arbitrary state τ (M) i of the Mth subsystem (which contains the Nth qubit). Equation (C.3) can be easily proved by resorting to equation (C.1). For example, when considering the case j = 1, we get: Tr τ i.e. that the EG N triple of any Q M -separable state is a convex combination of the Hadamard products between the M 3 Kα triples corresponding to the first M − 1 subsystem states and the EG KM triple of the Mth subsystem state.
By assuming that the Nth qubit belongs to the Mth subsystem, we get that c (α) i ∈ B 1 when α < M and K α is odd, c (α) i ∈ T (−1) Kα /2 when α < M and K α is even, d where we define the Hadamard product between any two sets A and B as (C.8) The commutativity and associativity of the Hadamard product allow us to rearrange the ordering in equation (C.6) in the following way For any even N-qubit system, only a Q M partitioning within cases (i), (v)-(ix) may be realised. In cases (i), (v) and (vi), i.e. when either K α is even for any α or K α is odd for just two values of α, one of which is α = M, we have that S EGN QM is the set B 1 of all EG N states. Otherwise, in cases (vii)-(ix), we have S EGN QM = O 1 . For any odd N-qubit system, only a Q M partitioning within cases (ii)-(iv) and (vii)-(ix) may be realised. In cases (ii) and (iii), i.e. when K α is odd only for α = M, we have that S EGN QM is the set T (−1) (N−1)/2 of all EG N states. Otherwise, in cases (iv), (vii), (viii) and (ix), we have