The present disclosure relates generally to the field of quantum operations. More specifically, the present disclosure provides at least a system and method for the measurement of field properties using quantum sensor networks.
Harnessing entanglement between many particles is key to a quantum advantage in applications including sensing and timekeeping, secure communication, and quantum computing. Encoding quantum information into a multiqubit Greenberger-Horne-Zeilinger-like state is particularly desirable as a subroutine in many quantum applications, including metrology, quantum computing, anonymous quantum communication, and quantum secret sharing.
Accordingly, there is interest in the measurement of field properties using quantum sensor networks.
An aspect of the present disclosure provides a system for the measurement of field properties. The system includes a quantum system, a processor, and a memory. The quantum system includes a plurality of quantum sensors coupled to a field. Each sensor of the plurality of quantum sensors is located at a fixed position in the field. The fixed position depends on parameters. Each sensor of the plurality of quantum sensors is entangled. The memory includes instructions stored thereon, which, when executed by the processor, cause the quantum system to: access a signal of the quantum system; sense a plurality of interdependent local field amplitudes corresponding to the plurality of quantum sensors by locally probing the field by each sensor of the plurality of quantum sensors; estimate a function of the parameters at a position x0, wherein x0 is a position without any of the plurality of quantum sensors; and estimate an amplitude of the field at the position x0 based on the estimated function of the parameters.
In accordance with aspects of the disclosure, the estimate of the amplitude of the field at a position x0 may be based on measurements of a final state of the field, specified by a set of operators {{circumflex over (Π)}ξ} that constitute a positive operator-valued measure where ∫dξ{circumflex over (Π)}ξ=1.
In an aspect of the present disclosure, the field may include local field amplitudes.
In another aspect of the present disclosure, the instructions, when executed, may further cause the system to determine an optimum quantum sensor placement in the field based on the estimated function of the parameters.
In yet another aspect of the present disclosure, the instructions, when executed, may further cause the system to determine a mean squared error (MSE) of the estimated function of the parameters from a true value of the parameters.
In accordance with further aspects of the present disclosure, the instructions, when executed, may further cause the system to evaluate the MSE of the estimated function for any set of positions of the plurality of quantum sensors and change the position of each sensor of the plurality of quantum sensors based on the evaluated MSE.
In an aspect of the present disclosure, the plurality of quantum sensors may include Mach-Zehnder interferometers or qubits.
In another aspect of the present disclosure, each sensor of the plurality of quantum sensors may be associated with a Hilbert space.
In yet another aspect of the present disclosure, the values of the parameters at the fixed positions in the field may be unknown.
An aspect of the present disclosure provides a method for the measurement of field properties. The method includes accessing a signal of a quantum system. The quantum system includes a plurality of quantum sensors coupled to a field. Each sensor of the plurality of quantum sensors is located at a fixed position in the field. The fixed position depends on parameters. The values of the parameters are unknown. Each sensor of the plurality of quantum sensors is entangled. The method further includes sensing a plurality of interdependent local field amplitudes corresponding to the plurality of quantum sensors by locally probing the field by each of the plurality of quantum sensors; estimating a function of the parameters at a position x0 based on the sensed plurality of interdependent local field amplitudes, wherein x0 is a position without any of the plurality of quantum sensors; and estimating an amplitude of the field at the position x0 based on the estimated function of the parameters.
In another aspect of the present disclosure, the estimate of the field value at a position x0 may be based on measurements of a final state, specified by a set of operators {{circumflex over (Π)}ξ} that constitute a positive operator-valued measure where ∫dξ{circumflex over (Π)}ξ=1.
In yet another aspect of the present disclosure, the field may include local field amplitudes.
In yet another aspect of the present disclosure, the method may further include determining optimum quantum sensor placement in the field based on the estimated function of the parameters.
In another aspect of the present disclosure, the method may further include determining a mean squared error (MSE) of the estimated function of the parameters from a true value of the parameters.
In yet another aspect of the present disclosure, the method may further include evaluating the MSE for any set of positions of the plurality of quantum sensors and changing the position of each sensor of the plurality of quantum sensors based on the evaluated MSE.
In a further aspect of the present disclosure, the plurality of quantum sensors may include Mach-Zehnder interferometers or qubits.
In a further aspect of the present disclosure, each sensor of the plurality of quantum sensors may be associated with a Hilbert space.
An aspect of the present disclosure provides a method for the measurement of field properties. The method includes accessing a signal of a quantum system, the quantum system includes a plurality of entangled quantum sensors coupled to a field. Each sensor of the plurality of entangled quantum sensors is located at a fixed position in the field. The fixed position depends on a set of parameters. The values of the parameters are unknown. The method may further include sensing a local field value corresponding to a signal sensed by each sensor of the plurality of quantum sensors and estimating a function of the parameters at a first position in the field, wherein the first position is a position in the field without any of the plurality of entangled quantum sensors.
In another aspect of the present disclosure, each sensor of the plurality of quantum sensors may be associated with a Hilbert space.
In yet another aspect of the present disclosure, the plurality of quantum sensors may include Mach-Zehnder interferometers or qubits.
Further details and aspects of exemplary aspects of the present disclosure are described in more detail below with reference to the appended figures.
A better understanding of the features and advantages of the present disclosure will be obtained by reference to the following detailed description that sets forth illustrative aspects, in which the principles of the present disclosure are utilized, and the accompanying drawings of which:
The present disclosure relates generally to the field of quantum operations. More specifically, the present disclosure provides at least a system and method for the measurement of field properties using quantum sensor networks.
Aspects of the present disclosure are described in detail with reference to the drawings wherein like reference numerals identify similar or identical elements.
Although the present disclosure will be described in terms of specific examples, it will be readily apparent to those skilled in this art that various modifications, rearrangements, and substitutions may be made without departing from the spirit of the present disclosure. The scope of the present disclosure is defined by the claims appended hereto.
For purposes of promoting an understanding of the principles of the present disclosure, reference will now be made to exemplary aspects illustrated in the drawings, and specific language will be used to describe the same. It will nevertheless be understood that no limitation of the scope of the present disclosure is thereby intended. Any alterations and further modifications of the novel features illustrated herein, and any additional applications of the principles of the present disclosure as illustrated herein, which would occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the present disclosure.
Referring to
The field ƒ(x; θ) is analytically parameterized by the vector of parameters θ. The qubit sensors are fixed at positions {x1, . . . , xd}. While the functional form of ƒ(x; θ) is known, the parameters θ are not. The bounds on the precision of measuring an arbitrary analytic function q(θ) of the parameters θ are saturable. The disclosed technology can be applied to many problems, including optimal placement of quantum sensors 102, field interpolation, and the measurement of functionals of parametrized fields.
A set of quantum sensors 102 at positions {x1, . . . , xd} is locally probing a physical field ƒ(x; θ), which depends on a set of parameters θ∈k. For example, at each position xi in the network, a quantum sensor 102 is coupled to a field ƒ(x; θ). The functional form of ƒ(x; θ) is assumed to be known, but the values of the parameters θ are unknown. The parameters may be the positions of several known charges, and ƒ(x; θ) one of the components of the resulting electric field. An objective is to estimate a function of the parameters q(θ). This could be, for instance, the field value q(θ)=ƒ(x; θ) at a position x0 without sensor, or the spatial average q(θ)=∫Rdxƒ(x; θ) over some region R of interest.
The disclosed systems and methods utilize entanglement to obtain the highest accuracy allowed by quantum mechanics in estimating the quantity q(θ). One example problem that the disclosed technology may be used to solve is to estimate the field value q=ƒ(x; θ) at a location x0 104 without a sensor. Entanglement refers to a physical phenomenon where a quantum state of each particle of the group cannot be described independently of the state of the others, including when the particles are separated by a large distance.
In another example, consider a network of three quantum sensors 102 that are locally coupled to a field ƒ(x; θ1, θ2) parametrized by θ=(θ1, θ2). The field amplitudes at the positions of the quantum sensors 102 shall be ƒ1=θ1, ƒ2=θ2, ƒ3=θ1+θ2, respectively, where ƒi(θ)=ƒ(xi; θ). For example, one possible strategy to measure the value of q(θ1, θ2)=θ1 is to simply use the first sensor to measure II. On the other hand,
may also be measured, thereby potentially gaining accuracy by harnessing entanglement between the individual sensors.
The disclosed technology provides the benefit of estimating a function of the parameters, q(θ1, . . . , θk), instead of estimating a given function F(ƒ1, . . . , ƒd) of independent local field amplitudes ƒ1, . . . , ƒd. Due to the correlation of the local field amplitudes, there are many measurement strategies that need to be considered and compared in terms of accuracy. The disclosed technology may be used for many applications, including, for example, optimal spatial sensor placement and field interpolation.
The quantum system 100 generally includes a collection of d quantum subsystems, called quantum sensors 102, each associated with a Hilbert space i. The full Hilbert space is =⊗i=1di. A collection of field amplitudes f(θ)=(ƒ1(θ), . . . , ƒd(θ))T is imprinted onto a quantum state, represented by an initial density matrix pin, through the unitary evolution: pƒ=U(ƒ)pinU(ƒ)t. Here, θ=(θ1, . . . , θk)T is a set of independent unknown parameters. The unitary evolution is generated by the Hamiltonian:
with the Pauli operators {circumflex over (σ)}ix,y,z acting on qubit i and ƒi(θ)=ƒ(xi, θ) the local field amplitude at the position of the ith quantum sensor 102. The term Ĥc(t) is a time-dependent control Hamiltonian, which may include coupling to ancilla qubits. Ancilla qubits are extra bits being used, for example, to determine measurement outcomes for check operators without needing to measure them directly.
A given function of the parameters q(θ) is estimated. The estimate is based on measurements of the final state pƒ, specified by a set of operators {{circumflex over (Π)}ξ} that constitute a positive operator-valued measure (POVM) with ∫dξ{circumflex over (Π)}ξ=1. This experiment may be repeated many times to estimate the function of interest q(θ) via an estimate {tilde over (q)} obtained from the data. The sensor placements enable an estimate of a true value of θ to be obtained, which ensures the problem is solvable. This implies that the number d of quantum sensors 102 should be larger than k. The choice of initial state pin, control Hamiltonian Ĥc(t), and POVM {{circumflex over (Π)}ξ} defines a protocol to estimate q(θ).
θ is treated as a stochastic variable, and the true value of θ is denoted by θ′. Thus q(θ) is again a stochastic quantity, whereas q(θ′) is a specific number obtained by evaluating the function at the true value θ′. Indices i, j=1, . . . , d are used to label quantum sensors 102 and m, n=1, k to label parameters.
The mean squared error (MSE) of the estimate el from the true value q(θ′) is given by
=[{tilde over (q)}−q(θ′))2]=Var {tilde over (q)}+([{tilde over (q)}]−q(θ′))2, (Eqn. 2)
where the first and second terms are the variance and estimate bias, respectively. The optimal protocol to measure q(θ′) minimizes given a fixed amount of total time t. To determine the optimal protocol, lower bounds on are derived using quantum information theory techniques. These bounds are then saturated by specific protocols.
To derive a saturable lower bound on that can be achieved in time t, first begin with the following result on a single-parameter estimation. If the unitary evolution of the quantum state is controlled by a single parameter q, then
where Q is the quantum Fisher information, ĥq=∂Ĥ/∂q as is the generator with γmax (γmin) its largest (smallest) eigenvalue, and ∥ĥq∥s=γmax−γmin is the seminorm of ĥq. The first inequality is the quantum Cramér-Rao bound.
It is not obvious that Eqn. 3 may be applied to the problem of estimating q(θ) as k>1 parameters control the evolution of the state. However, this may be circumvented by considering an infinite set of imaginary scenarios, each corresponding to a choice of artificially fixing k−1 degrees of freedom and leaving only q(θ) free to vary. Under any such choice, the final quantum state depends on a single parameter and Eqn. 3 may be applied to the example scenario described above.
Additional information can only result in a lower value of . Therefore, any lower bound on derived from any of the imaginary scenarios is also a lower bound for estimating the function q(θ). For a bound derived this way to be saturable, there must be some choice(s) of artificially fixing k−1 degrees of freedom that does not give us any useful information about q(θ), and thus yields the sharpest possible bound.
More formally, consider a basis {α1, α2, . . . , αk} such that, without loss of generality, α1=∇q(θ′)=:α. Next, consider any choice of the remaining basis vectors. For any such choice, let a, correspond to a function qn(θ)=αn·θ. For a particular choice of basis, a corresponding set of functions {q1(θ)=q(θ), q2(θ), . . . , qk(θ)} are considered. Given the values {qn(θ′)}n≥2 and fixing k−1 degrees of freedom, the resulting problem is now determined by a single parameter and Eqn. 3 applies.
The derivative of H with respect to q, while holding q2, . . . , qk fixed, is
Using the chain rule β satisfies α·β=1.
Every β∈k in Eqn. 4 corresponds to a valid choice of the k−1 dimensional subspace spanned by {αn}n≥2.
Therefore, since ĥq depends on {αn}n≥2 only through β, the tightest bound on is found by optimizing over arbitrary choices of β subject to the constraint α·β=1.
To formulate the corresponding optimization problem, define the matrix G by
G depends on the true value of the parameters θ ′. Utilizing,
the seminorm of ĥq is written as
the L1 or Manhattan norm. Therefore, for any β satisfying
In order to obtain the sharpest bound, what is referred to as the bound problem for G(θ′) and α is solved. Given a non-zero vector α∈k and a real d×k matrix G,
is computed under the condition α·β=1. This is a linear programming problem and may be solved in time that is polynomial in d and k. Hereafter, the resulting sharpest bound is referred to as “the bound.”
For clarity of presentation, the protocol that saturates this bound is developed in the case that both the field f(θ) and the objective q(θ) are linear in the parameters θ; that is, f(θ)=Gθ, with θ-independent G, and q(θ)=α·θ. However, the existence of an asymptotically optimal protocol can be proven in the more general case that f(θ) and q(θ) are analytic about the true value θ′.
For the linear case, an explicit protocol to measure q and show that it saturates the bound and thus is optimal is shown. The optimal protocol measures the linear combination
λ(f)=w·f, (Eqn. 8)
where f is the vector of local field amplitudes. The vector w∈d is chosen such that {tilde over (λ)}(f)={tilde over (q)}(θ) is an unbiased estimator of q(θ′), and will be optimized to saturate the bound. For d>k, there are many choices of w that satisfy λ=q.)
For the estimator {tilde over (λ)} to be unbiased, [{tilde over (q)}]=q(θ′)=α·θ. This is achieved by choosing w to satisfy the consistency condition:
G
T
w=α, (Eqn. 9)
implying:
[{tilde over (q)}]=[w·f]=(Gθ′)Tw=θ′·(GTw)=α·θ′. (Eqn. 10)
Under the assumption θ′, Eqn. 9, may always be satisfied for some w, and therefore the protocol is valid.
where ∥w∥∞=maxi|wi|. Since the problem deals with an unbiased estimator, the MSE coincides with the variance of the estimator in Eqn. 11.
In order to find w with the lowest possible value of ∥w∥∞ (i.e., the smallest variance), the “protocol problem” must be solved. The protocol problem may be described as: given a non-zero vector α∈k and a real d×k matrix G, compute
under the condition GTw=α. The protocol problem may be efficiently solved by generic linear programming algorithms or special-purpose algorithms.
To illustrate that the optimal protocol for solving this problem saturates the bound, the bound problem and protocol problem are equivalent in that u=u′. The strong duality theorem for linear programming may be used for solving the protocol problem. It states that, for linear programming problems like the protocol problem, there is a dual problem whose solution is identical to the original problem. In this case, the following dual problem exists:
Dual protocol problem: Given a non-zero vector α∈k and a real d×k matrix G, compute
under the condition ∥Gv∥1≤1.
The strong duality theorem then implies u″=u′. Additionally, there is a correspondence between the two solution vectors w0 and v0, so that, given the solution vector to one problem, the solution vector to the other may be found.
Let u and u′ be the solutions to the bound and protocol problems, respectively. Then u=u′.
Proof By the strong duality theorem, the solution of the dual-protocol problem satisfies u″=maxvα·v=u′. Let the corresponding solution vector of the dual-protocol problem be v0. Define β0:=v0/u′. α·β0=u′/u′=1, thus β0 satisfies the constraint of the bound problem. To prove the theorem u′≤u and u≤u′ must be shown. On the one hand, provided ∥Gβ0∥1≠0, the condition ∥Gv0∥1≤1 of the dual problem implies
On the other hand, for any β satisfying the constraint α·β of the bound problem and for the optimal w=w0 of the protocol problem satisfying ∥w0∥∞=u′, Hölder's inequality yields:
This shows that u′≥1/∥Gβ∥1 for all β, thus u′≥u, which completes the proof.
As a byproduct, eqn. 12 illustrates that β0 maximizes 1/∥G∥1, and so is the solution vector of the bound problem. The protocol measuring λ with optimal w saturates the bound.
Consider three sensors coupled to local field amplitudes ƒ1(θ)=θ1, ƒ2(θ)=θ2, and ƒ3(θ)=θ1+θ2. Since q(θ)=θ1, so α=(1,0)T.
The constraint α·β=1 implies β=(1, b)T with arbitrary b. The maximum of 1/∥Gβ∥1 is achieved for β0=(1,0)T, yielding u=½. For the protocol problem, the constraint in Eqn. 9 gives w1+w2=1 and w2+w3=0. The corresponding minimal value
of Finally, for the dual-protocol problem, the constraint ∥Gv∥1≤1 implies |v1|+|v2|+|v1+v2|≤1. The solution vector is v0=(½,0)T, which yields u″=α·v0=½. This explicit example demonstrates that u=u′=u″. Furthermore, β0=v0/u′.
The best-entangled weighting strategies and best-unentangled weighting strategies need not be the same. With or without entanglement, estimate q(θ)=θ1 by measuring a linear combination w·f with the constraints w1+w3=1, w2+w3=0. Without entanglement, the only option is to measure each component of f independently in parallel for time t, yielding a total MSE for q(θ) of ∥w∥22/t2. In stark contrast, for the entangled case, the MSE is given by ∥w∥∞2/t2. It is easy to see that minimizing the Euclidean and supremum norm of w, subject to the constraints, does not yield the same result: Without entanglement,
is optimal, yielding an MSE of
With entanglement,
is optimal, with MSE of
This simple example snows that to achieve the optimal result with entanglement, the weights w that are optimal generally cannot be used without entanglement.
The results are practically relevant for any situation where one knows the functional form of the field of interest ƒ(x; θ) and seeks to determine some quantity dependent on the parameters of that field. Examples include functionals of the form q(θ)=∫Rdxk(x)ƒ(x; θ) with any kernel k(x) and region of integration R. The examples from the introduction correspond to k(x)=δ(x−x0) and k(x)=1. Since the θ-dependence of ƒ(x, θ) is analytic, this amounts to evaluating an analytic function q(θ).
The findings are also relevant for determining the optimal placement of sensors in space, i.e., determining the best locations x1, . . . , xd in the control space X in which they reside. For example, if the sensors are confined to a plane, then X=2. This problem clearly consists of two parts: (1) evaluating the best possible MSE for any chosen set of sensor locations and (2) optimizing the result over possible locations. The MSE amounts to the cost function in usual optimization problems. The results solve this first part as it would be used in the inner loop of a numerical optimization algorithm. The full problem, also involving the second part, is a high dimensional optimization in a space of dimension d×dim(X) Therefore, in general, one expects that finding the global optimal placement could be quite challenging. However, even finding a local optimum in this space is clearly of practical use.
In aspects, it may be assumed that an individual estimate of the true value θ′ of the parameters may be obtained, one could imagine situations where this assumption is not satisfied. Some such systems are underdetermined and not uniquely solvable. However, in some cases θ→θ* may be reparametrized in order to satisfy the assumption. For example, if two parameters in the initial parametrization always appear as a product θ1θ2 in both ƒ and q, θ1 or θ2 cannot be individually estimated. However, θ1θ2→θ1* may be reparametrized and thus satisfy the initial assumption.
The disclosed technology applies to physical settings beyond qubit sensors, for example, any situation where Eqn. 3 may be applied, the results of the disclosed technology should hold, provided the corresponding seminorm is used for the particular coupling. For example, the disclosed technology may be used by employing a collection of d Mach-Zehnder interferometers where the role of local fields is played by interferometer phases. Here the limiting resource is the number of photons N available to distribute among interferometers and not the total time t. Under the assumption that this conjecture is correct, Eqn. 11 may be replaced with
and otherwise, everything remains the same as in the qubit sensor example. One could also consider the entanglement-enhanced continuous-variable protocol for measuring linear combinations of field-quadrature displacements. The bound and protocol could be extended to all the scenarios just described or even to the hybrid case where some local fields couple to qubits, some to Mach-Zehnder interferometers, and some to field quadratures. The ultimate attainable limit in such physical settings remains an open question, however.
One could consider the case d<k provided the d sensors are not required to be at fixed locations. For instance, if one had access to continuously movable sensors in a 1D control space X, by the Riesz representation theorem, one could encode any linear functional of ƒ(x; θ) by moving the sensors according to a particular corresponding velocity schedule. As a simple example, one can consider evaluating the integral of some function of (i.e., one component of) a magnetic field over one-dimensional physical space by moving a qubit sensor through the field and measuring the accumulated phase. One could also consider variations of this work in the context of semiparametric estimation.
Referring to
The processor 210 may be connected to a computer-readable storage medium or a memory 211. The computer-readable storage medium or memory 211 may be a volatile type of memory, e.g., RAM, or a non-volatile type of memory, e.g., flash media, disk media, etc. In various aspects of the disclosure, the processor 210 may be any type of processor such as a digital signal processor, a microprocessor, an ASIC, a graphics processing unit (GPU), a field-programmable gate array (FPGA), or a central processing unit (CPU).
In aspects of the disclosure, the memory 211 can be random access memory, read-only memory, magnetic disk memory, solid-state memory, optical disc memory, and/or another type of memory. In some aspects of the disclosure, the memory 211 can be separate from the processor and can communicate with the processor through communication buses of a circuit board and/or through communication cables such as serial ATA cables or other types of cables. The memory 211 includes computer-readable instructions that are executable by the processor 210 to operate the processor. In other aspects of the disclosure, the system 200 may include a network interface to communicate with other computers or to a server. A storage device may be used for storing data.
Referring to
In aspects of the disclosure, the memory can be random access memory, read-only memory, magnetic disk memory, solid-state memory, optical disc memory, and/or another type of memory. In some aspects of the disclosure, the memory can be separate from the processor and can communicate with the processor through communication buses of a circuit board and/or through communication cables such as serial ATA cables or other types of cables. The memory includes computer-readable instructions that are executable by the processor to operate the processor. In other aspects of the disclosure, the controller may include a network interface to communicate with other computers or to a server. A storage device may be used for storing data.
Initially at step 302, the processor 210 accesses a signal of a quantum system 100. The quantum system 100 includes a plurality of quantum sensors 102 coupled to a field ƒ(x; θ). The plurality of quantum sensors 102 are entangled. Each sensor of the plurality of quantum sensors 102 is associated with a Hilbert space.
Each sensor of the plurality of quantum sensors 102 is located at a fixed position in the field ƒ(x; θ) which depends on parameters θ (
Next, at step 304, the processor 210 senses a plurality of local field amplitudes corresponding to the plurality of quantum sensors 102 by locally probing the field ƒ(x; θ) by each of the plurality of quantum sensors 102.
Next, at step 306, the processor 210 estimates a function of the parameters q(θ) at a position x0 based on the sensed plurality of local field amplitudes. x0 is a position 104 without any of the plurality of quantum sensors 102 (
In aspects, the processor 210 may determine an optimum quantum sensor 102 placement in the field ƒ(x; θ) based on the estimated function of the parameters.
In aspects, the processor 210 may determine a mean squared error (MSE) of the estimate {tilde over (q)} from a true value of the parameters θ. The processor 210 may evaluate the MSE for any set of positions of the plurality of quantum sensors and change the position of each sensor of the plurality of quantum sensors based on the evaluated MSE.
Next, at step 308, the processor 210 estimates an amplitude of the field ƒ(x; θ) at the position x0 based on the estimated function of the parameters.
Certain aspects of the present disclosure may include some, all, or none of the above advantages and/or one or more other advantages readily apparent to those skilled in the art from the drawings, descriptions, and claims included herein. Moreover, while specific advantages have been enumerated above, the various aspects of the present disclosure may include all, some, or none of the enumerated advantages and/or other advantages not specifically enumerated above.
The aspects disclosed herein are examples of the disclosure and may be embodied in various forms. For instance, although certain aspects herein are described as separate aspects, each of the aspects herein may be combined with one or more of the other aspects herein. Specific structural and functional details disclosed herein are not to be interpreted as limiting, but as a basis for the claims and as a representative basis for teaching one skilled in the art to variously employ the present disclosure in virtually any appropriately detailed structure. Like reference numerals may refer to similar or identical elements throughout the description of the figures.
The phrases “in an aspect,” “in aspects,” “in various aspects,” “in some aspects,” or “in other aspects” may each refer to one or more of the same or different example aspects provided in the present disclosure. A phrase in the form “A or B” means “(A), (B), or (A and B).” A phrase in the form “at least one of A, B, or C” means “(A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C).”
It should be understood that the foregoing description is only illustrative of the present disclosure. Various alternatives and modifications can be devised by those skilled in the art without departing from the disclosure. Accordingly, the present disclosure is intended to embrace all such alternatives, modifications, and variances. The aspects described with reference to the attached drawing figures are presented only to demonstrate certain examples of the disclosure. Other elements, steps, methods, and techniques that are insubstantially different from those described above and/or in the appended claims are also intended to be within the scope of the disclosure.
This application claims the benefit of, and priority to, U.S. Provisional Patent Application No. 63/263,426, filed on Nov. 2, 2021, the entire contents of which are hereby incorporated herein by reference.
This invention was made with government support under W911NF1610349 awarded by the Department of the Army; Army Research Office (ARO); PHY1430094 awarded by the National Science Foundation (NSF); and FA95501910275 awarded by the Air Force Office of Scientific Research (AFOSR). The government has certain rights in the invention.
Number | Date | Country | |
---|---|---|---|
63263426 | Nov 2021 | US |