Realizing permutation gates with PHI-bits: acoustic quantum analogue computing including encoding, encrypting, and decrypting information
Logical phi-bits in driven acoustic metamaterials enable efficient and secure permutations and encryption by leveraging exponentially scaling Hilbert space for parallel operations, addressing inefficiencies and vulnerabilities in quantum computing and cryptography.
Patent Information
- Application Number
- PCT/US2025/034288
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-06-21
- Filing Date
- 2025-06-18
- Publication Date
- 2026-11-12
AI Technical Summary
Current quantum computing approaches require multiple sequential actions for permutations, which are inefficient and prone to errors due to decoherence, and traditional cryptography is vulnerable to quantum computers.
Utilize logical phi-bits, represented as nonlinear acoustic modes in driven acoustic metamaterials, to perform permutations and encryption through a single physical action, leveraging exponentially scaling Hilbert space for parallel operations.
Achieves efficient and robust permutations and encryption with scalable, error-resistant operations, outperforming quantum computing in efficiency and security.
Smart Images

Figure US2025034288_12112026_PF_FP_ABST
Abstract
Description
085067-844959(UA24-289)REALIZING PERMUTATION GATES WITH PHI-BITS: ACOUSTIC QUANTUM ANALOGUE COMPUTING INCLUDING ENCODING, ENCRYPTING, AND DECRYPTING INFORMATIONGOVERNMENT SUPPORT
[0001] This invention was made with government support under Grant Nos. 193925; 2204400; and 2242925 awarded by National Science Foundation. The government has certain rights in the invention.CROSS REFERENCE TO RELATED APPLICATIONS
[0002] This is a PCT patent application that claims benefit to U. S. Provisional Application Serial No 63 / 662,408 filed on June 20, 2024; U. S. Provisional Application Serial No 63 / 662,698 filed on June 21, 2024; and U. S. Provisional Application Serial No. 63 / 663,032, filed on June 21, 2024, all of which are herein incorporated by reference in their entireties.FIELD
[0003] The present technology generally relates to acoustics and quantum technologies; and in particular to realization of permutation gates with phi-bits via acoustic quantum analogue computing including encoding, encrypting, and decrypting information.BACKGROUND
[0004] Permutations operations are fundamental to quantum computing and quantum computing analogues. Fundamental unitary transformations include the SWAP and CNOT gates which can be included in a set of universal gates in the quantum computing context. Yet, current quantum computing approaches require multiple sequential actions constituting a so-called circuit.
[0005] On a related note, cryptography is crucial in protecting sensitive information and ensuring secure transactions in a time when data security and privacy are major concerns. Traditional cryptography techniques, which depend on mathematical algorithms and secret keys, have historically protected against data breaches and illegal1103238682.1085067-844959(UA24-289) access. However, with the advent of quantum computers, traditional cryptography techniques are at risk.
[0006] It is with these observations in mind, among others, that various aspects of the present disclosure were conceived and developed.2103238682.1085067-844959(UA24-289)BRIEF DESCRIPTION OF THE DRAWINGS
[0007] FIG. 1 is a set of examples of observed phase differences 01and 01(p'<7)( / i) showing examples of continuous and n jump behavior. The values of p and q are given in the figure legend.
[0008] FIG. 2 is an example of measured 0i2of phi-bit 1 0^3, -2)and phi-bitfor implementing the SWAP gate by tuning the driving frequency from an initial marked by the vertical dashed line to a final frequency indicated by a solid vertical line.
[0009] FIG. 3 an example of experimentally measured13of phi-bit 1nd3. Vertical lines (dashed and solid) as in FIG. 2.
[0012] FIG. 6 is an example of experimentally measured 012of phi-bit 1phi-bit 2 (0i26,-3)) for implementing the permutation of components 1 and4. Vertical lines (dashed and solid) as in FIG. 2.
[0013] FIG. 7 is an example of experimentally measured 0i3of phi-bit 1 (0i3,-2')) and phi-bit 2 (0i31,2)) for implementing the permutation of components 2 and 4. Vertical lines (dashed and solid) as in FIG. 2.
[0014] FIG. 8 is an example of experimentally measured <p13of phi-bit 1andPhi-bit 2 (0i31,2)for implementing a cyclic permutation. Vertical lines (dashed and solid) as in FIG. 2.
[0015] FIG. 9 is an example of experimentally measured 0i2of phi-bit 1 (0i2-3:>) and phi-bit 2 (0^2-2)) for implementing a 2 phi-bit inversion. Vertical lines (dashed and solid) as in Fig. 2.3103238682.1085067-844959(UA24-289)
[0016] FIG. 10 is an example of experimentally measured12of phi-bit 1 ( i2-3)> phi-bit 2 ( i2-2)). and phi-bit 3 ( 12-1)), for demonstrating scalable inversion. Vertical lines (dashed and solid) as in FIG. 2.
[0017] FIG. 11 is an illustration of a quantum circuit used to (a) achieve the SWAP gate (b) permute components 2 and 4 of a two qubit state vector, (c) Quantum circuit to invert a two qubit state vector. The disentangler creates the initial state. The output state vector is indicated as dashed vertical line.
[0018] FIG. 12 is a series of examples of (a) experimentally measured r the five phi-bits 7=1...,5. (b) Rescaled and corrected. 13 is an illustration of indexing of the binary message ‘UA’ on a 5 phi-bits state vector.
[0020] Corresponding reference characters indicate corresponding elements among the view of the drawings. The headings used in the figures do not limit the scope of the claims.4103238682.1085067-844959(UA24-289)DETAILED DESCRIPTION
[0021] Aspects of the present disclosure include, in Part I, systems and methods and other inventive concepts for performing permutation operations using phi-bits (acoustic analogues of qubits). More specifically, Part I describes inventive concepts for addressing (all) possible permutations of a four component state vector describing the state of logical phi-bits in a complex Hilbert space. Aspects include a scalable inversion operation which displays the extraordinary power of the exponentially scaling complex Hilbert space to realize quantum analogue computing at scale. These permutations can be performed using a single physical action on the acoustic system while current quantum computing approaches require multiple sequential actions constituting a so-called quantum circuit.
[0022] Part II includes systems and methods for encoding, encrypting, and decrypting information using phi-bits. In particular, cryptography methods are described that use phi-bits that are supported by driven acoustic metamaterials. The state of phi-bits displays superpositions similar to quantum bits, with complex amplitudes and phases. Presented are representations of the state vector of single and multi-phi-bit systems. The state vector of such systems lies in a complex exponentially scaling Hilbert space and is used to encode information or messages. By changing the driving conditions of the metamaterial, the information can be encrypted with exceptional security and efficiency. The scalability of the system provides robust data security with encryption processing time remaining constant regardless of the number of phi-bits used.
[0023] PART I: REALIZATION OF PERMUTATION GATES WITH PHI-BITS VIA ACOUSTIC QUANTUM ANALOGUE COMPUTING
[0024] 1. Introductions
[0025] Permutations are key elements in many types of algorithms with application to cryptography, optimization, statistics, and analysis. For digital computers, permutations pose a significant challenge in terms of efficiency and computing time when operating on large datasets. The parallelism of quantum computers holds the promise of greater efficiency and reduced time. However, increasing the number of qubits challenges state-of-the-art quantum computing platforms due to system5103238682.1085067-844959(UA24-289) decoherence leading to accumulation of errors. Quantum algorithms resort to performing circuits of single and double qubit gates for realizing permutations.
[0026] Quantum computing is essentially phase computing where a coherent superposition of state of N qubit is defined by a multidimension vector with 2Wcomplex components living in an associated Hilbert space. The basis of the Hilbert space depends on the choice of the representation of the multi qubit states. Quantum correlations ought to make these components dependent on each other and manipulable in a massively parallel manner. A computation would then involve acting on the system to change all components of the complex vector at once in a controllable manner through a unitary operation (or gate), i.e., a rotation of the vector in the Hilbert space. One of the challenges in quantum computing is the fragility of multi qubit superpositions and the weak correlation limiting the number of qubits that can be manipulated simultaneously. It was previously demonstrated that nonlinear acoustic metamaterials can support logical phi-bits (acoustic qubit analogues) which superposition of states can also be represented in an exponentially scaling Hilbert space to achieve scalable gates for any number of phi-bits. A logical phi-bit is a nonlinear acoustic mode supported by an externally driven acoustic metamaterial which can exist in superposition of states. The two-level logical phi-bit is a classical analogue of a qubit. Nonlinearity provides the strong correlation necessary to realize massively parallel operations on multi-phi-bit states.
[0027] Inventive concepts herein include presentation of both the theoretical and experimental realization of permutations using a system of logical phi-bits. Further below, a logical phi-bit is defined as a nonlinear acoustic mode supported by a metamaterial composed of linearly arranged acoustic waveguides. A tensor product of modified Bloch sphere representations of multi-phi-bit states is introduced, which enables illustration that we can realize all possible two logical phi-bit permutations including SWAP and C-NOT. It is also experimentally shown that a single physical action on the driving condition of the acoustic metamaterial is sufficient to perform these permutations. In section 4, we demonstrate the scalability of a permutation for any number of logical phi-bits. Section 5 (of Part I) provides a comparison of the phi-bit system with its quantum counterpart using Qiskit simulations. In section 6, non-limiting6103238682.1085067-844959(UA24-289) observations and / or conclusions are drawn about the advantages of logical phi-bit permutations.
[0028] 2. PHYSICAL SYSTEM AND LOGICAL PHI-BIT
[0029] Logical phi-bits are generated with an acoustic meta-structure consisting of three aluminum waveguides, 60 cm long (approximately 1 cm in diameter) arranged linearly in a parallel array with the lateral spacing of 2mm filled with epoxy. The waveguides are labeled 1, 2, and 3, with waveguide 2 positioned between 1 and 3. At one end of waveguides 1 and 2, sinusoidal waves of equal amplitude 80V are generated with frequency= 62kHz and f2= 66kHz respectively, using ultrasonic transducers. Each transducer is driven by two separate signal generators to reduce unwanted crosstalk. The third waveguide remains unexcited. The amplitude and the phase of the propagated wave is measured at the other end of the three waveguides using another set of ultrasonic transducers connected to an oscilloscope. The measured amplitudes were transformed to the frequency domain using Fast Fourier Transform (FFT). On the spectral domain, we observe strong peaks at the primary frequencies, and f2, as well as secondary peaks corresponding to nonlinear modes at frequencie given by linear combinations of the primary frequencies.F(P, Q) =PFI + QF2
[0030] In Eq. (1 ), p and q are the integer coefficients of the linear combination of the primary frequencies. The modes corresponding to the secondary peaks’ frequencies F^'^ are identified as the logical phi-bits. Therefore, a logical phi-bit is said to exist in the spectral domain of this setup and all phi-bits i.e., nonlinear modes coexist in the same physical domain.
[0031] A phi-bit with characteristic frequency F^p’qcan also be characterized by the phase difference of the measured displacement between waveguides 1 and 2 and between waveguides 1 by settingwaveguide 1’s phase as the reference phase as shown below.7103238682.1085067-844959(UA24-289)
[0032] These phases are controlled by varying the driving frequency by Av ranging from 0 to 4kHz while keeping f2fixed. We track the location of the phi-bit on the spectral domain and compute the phase differences at each new phi-bit characteristic frequency.
[0033] The phase differences exhibit two consistent behaviors as a function of the driving frequency fr. These behaviors are shown in FIG. 1. The phase differences are the superposition of monotonous continuous variations and sudden IT jumps occurring at certain frequencies. The continuous behavior is consistent across all phi-bits. In particular, if we monitor the phase differences between rods 1 and 2 and rods 1 and 3 at the primary frequencies, namely12( ) and <>13( / i) where / =1,2, the monotonous contribution to ^'^andare given by+ p rz f ) and P i3( / i) + P^isCA)- Both behaviors are consistently observed in all the phi-bits and for the scope of this work. We take advantage of both behaviors to achieve permutation operations described herein.
[0034] Each logical phi-bit characterized by its frequency possesses two degrees of freedom in the form of the phase differences (<>12and <>13). We make the choice of a Bloch’s sphere representation of the state of a logical phi-bit (p,q) as follows,
[0035] In Eq. (3), the Bloch sphere representation includes two degrees of freedom p and y, which are taken as functions of < >12and < >13.
[0036] In this work, we are able to realize all possible permutation gates acting on two phi-bits by taking y = 0. p is also chosen as a function of12or < >13. With this, the representation of Eq. (3) simplifies to8103238682.1085067-844959(UA24-289)
[0037] Consequently, the state vector of a two phi-bits system can be represented as the tensor product of each phi-bits state vector:where and p^ are associated to phi-bit 1 and phi-bit 2, respectively.
[0038] 3. PERMUTATION GATES ACTING ON TWO PHI-BITS
[0039] To implement two phi-bits permutations, we introduce a new representation of the two phi-bits state vector:
[0040] In Eq. (6), H(x) stands for the Heaviside function such that H(x) = x_ > r 1, x > 0|x| t— 1, X < O'
[0041] For the sake of simplicity we use a more compact notation such thatare written as SltC1:S2, and C2, respectively. With this Eq. (6) becomes:9103238682.1085067-844959(UA24-289)
[0042] Considering an initial vector are seeking changes inthe driving conditions leading to changes in (3^ and (3^2such that the state vector transforms according to:V1= P x V (8)where P is a 4 x 4 permutation unitary matrix.
[0043] 3.1 Realizing SWAP Permutation Gate / I 0 0 0\
[0044] Here, we realize the permutation matrix, P = I ® ®® I whichW O O Lpermutes the second and third components of the two phi-bits state vector. This is the SWAP permutation gate. Let us consider a two phi-bit system initialized at arbitrary values of?(1 )and?(2). Depending on the initial value of(i.e., the sign of the C2), Eq. (7) gives two possible initial state vectors. We choose C2> 0, such that the initial state vector is taking the form:10103238682.1085067-844959(UA24-289)
[0045] To swap components 2 and 3 of this state vector we need to tune the frequency of the physical system such that the phase difference of phi-bit 1 (either i2 or <>13definingremains constant and the phase difference of phi-bit 2 (defining / ?®) changes by +n such as:
[0046] In Eq. (10) the * labels the phase difference after the change in frequency. The change by n of p(i)changes the sign of C2to a negative value such that Eq. (7) gives a new state vector through the Heaviside function. As a result, the state vector transforms according to:
[0047] The minus signs come from the trigonometric relations cos(J3^ ±
[0048] To a general phase of n associated with the - sign in V* that we can disregard, the transformation can be expressed in terms of the desired SWAP gate as follows:
[0049] To execute the SWAP gate experimentally, we consideri=1,2 to be functions of (p2,q). We choose phi-bit 1 to be the nonlinear mode with (p=3, q=-2)11103238682.1085067-844959(UA24-289) and phi-bit 2 to be the mode with (p=3, q=-1 ). The phase difference of phi-bit 1 (0^'2)) and phi-bit 2are illustrated in FIG. 2. We initialized the phi-bits at frequency = 64.05 kHz and tune the driving frequency to 64.15 kHz. At the initial frequency, the initial <p12of phi-bit 1 is 2.04 rad and the initial12of phi-bit 2 is 5.94 rad. After tuning, the phase difference for phi-bit 1 remains nearly constant and the phase difference for phi-bit 2 decreases by n through the n jump. The change in state vectors for this permutation is shown below where considering the absolute value of the state vector, we observed the second and third components of the state vector are swapped.
[0050] Disregarding the change in signs, the physical operation swaps the second component with the third component while keeping the first and the fourth components nearly the same. We note that the numerical values of the components of the state vector may change by no more than 0.1 due to the fact that the jump in phase is not exactly n and that [3( )is not exactly constant over the range of frequency spanned by the physical operation.
[0051] 3.2 Realizing C-Not Permutation Gate
[0052] Here, we realize the permutation matrix, P = whichpermutes the third and fourth components of the two phi-bits state vector. This is the C-NOT gate. In this case, we use the same initial state vector as in subsection 3.1 (Eq. (9)) but must restrict the initial phase difference such that?(1)G [0, n] and,?(2)G [—71 Tr]2 ' 2
[0053] By tuning the driving frequency, such that the phase difference of the first phi-bit exchange with that of the second phi-bit:12103238682.1085067-844959(UA24-289)^(2)* — ^g(l)the transformed state vector becomes by permutation of indices:This transformation is equivalent to the unitary transformation of the statevector with a C-NOT gate by commutativity of the multiplication:
[0055] We set / =-| 2 as functions of ^'^only. We implement the C-NOT permutation using experimentally measured data for phi-bitand phi-bit 2These phases are shown in FIG. 3. The experimental phase difference for phi-bit 1 lies between 0 and n. The experimental phase difference for phi-bit 2 was translated by an inconsequential constant to constrain it to be between and The C-NOT permutation is achieved by initializing the phi-bits at frequency= 63.15 kHz and tuning it to 63.70 kHz. The initial13for phi-bit 1 is 0.76 rad and the initial13for phi-bit 2 is 0.31 rad. After frequency tuning, the phase differences of phi-bit 1 and phi-bit 2 are exchanged so that the final phase difference for phi-bit 1 is the initial phase difference for phi-bit 2 and the final phase difference for phi-bit 2 is the initial phase difference for phi-bit 1. The initial and final state vectors are shown below where we observed the third and fourth components are swapped.13103238682.1085067-844959(UA24-289)
[0056] After permutation, the small changes in the numerical values of the components (less than 5%) arise from the small amount of noise in the experimentally measured phases.
[0057] 3.3 Permuting Components 1 and 2
[0058] Let us use the initial state vector of subsection 3.2 with the same restrictionsand,
[0059] To achieve permutation of components 1 and 2 of the state vector we must tune the frequency of the physical system such thatis exchanged with the / ?(2)and?(1)increases by and / ?2)decreases by
[0060] Using the exchange of indices and the trigonometric relations,-cos(0), the initial state vector transforms according to:
[0061] There is a n phase difference between some of the components of the new state vector due to the sign change. This operation is described below:14103238682.1085067-844959(UA24-289)
[0062] The transformation matrix in Eq. (19) is the product of a phase gate and the desired permutation gate, such that:
[0063] Disregarding the change in sign, we have achieved the permutation of the first and second components.
[0064] This permutation is achieved by expressing / =1,2 as functions using experimentally measured data of phi-bit 1 (0^'-2)) and phi-bit 2shown in FIG. 4. For this permutation the experimental phase difference of phi-bit 1 is translated by a constant phase such that it lies between 0 and n. The experimental phase difference of phi-bit 2 is translated by another constant phase such that it falls between and The phi-bits are initialized at frequency- 63.45 kHz and the frequency of the system is tuned from its initial value to 63.95 kHz. At the initial frequency, the initial13for phi-bit 1 is 1.12 rad and the initial <p13of phi-bit 2 is -1.08 rad. After tuning, the phase difference for phi-bit 1 becomes the initial phase difference of phi-bit 2 plus and phase difference of phi-bit 2 becomes the initial phase difference of phi-bit 1 minus This gives the change in state vectors shown below:
[0065] Making abstraction of the change in sign V* is obtained by simply permuting components 1 and 2 of V.
[0066] The small variations in numerical values of the state vector components result from small noise in the experimental data.
[0067] 3.4 Permuting Components 1 and 315103238682.1085067-844959(UA24-289)
[0068] We consider the initial state vector of a two phi-bits system with the following restrictions on?(1)and?(2): p(r>e [TT, and Eq. (7) gives the initial state vector below:
[0069] To permute components 1 and 3 of the state vector, we must tune the frequency of the physical system such that / ?(1)is exchanged with the?(2)and?(1)increases bydecreases by as was also done in subsection 3.3:
[0070] By permuting the indices and using the same trigonometric relations as subsection 3.3, the state vector transforms according to:
[0071] This transformation permutes the first and third components and is equivalent to a transformation achieved using the matrix given below.16103238682.1085067-844959(UA24-289)
[0072] The transformation matrix in Eq. (24) is the product of a phase gate and the desired permutation gate, such that:
[0073] By disregarding the phase change in the transformed state vector / *’ we have successfully permuted the first and third component of the state vector.
[0074] This permutation is achieved with the same two phi-bits as section3.3. However, the experimental phase difference of phi-bit 1 was adjusted by a constant to fall between n and 2n. The experimental phase difference of phi-bit 2 was translated by another constant to lie between - and — The phi-bits are now initialized at frequency = 63.45 kHz. At the initial frequency of 63.45 kHz, the initial <>13of phi-bit 1 is 4.61 rad and the initial <>13of phi-bit 2 is 2.39 rad. This permutation is achieved by tuning the frequency to 63.95 kHz. Upon tuning, the phase difference of phi-bit 1 becomes the initial phase difference of phi-bit 2 plus and the phase difference of phi-bit 2 becomes the initial phase difference of phi-bit 1 minus The resulting change in state vectors is illustrated below:
[0075] Independently of some changes in sign, this transformation permutes components 1 and 3 with minimal change in the numerical value of the components themselves.
[0076] 3.5 Permuting Components 1 and 4
[0077] For the permutation of components 1 and 4, let us consider a two phi-bit system initialized at arbitrary values of?(1JandLike subsection 3.1, Eq. (7)17103238682.1085067-844959(UA24-289) gives two possible initial state vectors depending on the initial value of p^ (i.e., the sign of the C2). Here, we choose C2< 0, such that the initial state vector takes the form:
[0078] Tuning the frequency to manipulate the phase difference such that?(1)increases by and / ?(2)by n.(2)*=^(2)+ n
[0079] Adding n to p^ makes C2> 0, by virtue of the trigonometric relation cos(0 + n) = -cos(0), this effect the value of the Heaviside function in Eq. (7) / -5XS2\I C C |such that the vector V becomes *r2. The minus signs arise from the trigonometric\— C1S2 / relation sin(0 + TT) = -sin(0). This first step effectively swaps component 2 and 3.Using the trigonometric relations employed in section 3.3 to address the change in p': )by transforms the state vector as:
[0080] In matrix form the whole operation takes the form:18103238682.1085067-844959(UA24-289)
[0081] The unitary transformation in Eq. (29) is effectively the product of a phase gate with the desired permutation gate as follows:
[0082] To within phase changes of the components of the state vector we have realized the gate which permutes the first and the fourth components of the state vector.
[0083] This permutation is achieved by expressing, i=,\,2 as functions using experimentally measured data of phi-bit 1and phi-bit 2s shown in FIG. 6. Here, there is no restriction on the range of values of the phase differences, we used the raw experimental data without adjustment. The permutation is achieved by initializing the phi-bits at frequency fa = 63.35 kHz and tuning it to 64.65 kHz. At the initial frequency, the initial cf>12for phi-bit 1 is 1.43 rad and the initial12for phi-bit 2 is 0.34 rad. After tuning, the phase difference for phi-bit 1 increases by and the phase difference for phi-bit 2 increases by it. Increasing the phase difference of phi-bit 1 by reverse the order of the state vector, by permuting simultaneously components 2 and 3 and components 1 and 4. Increasing the phase difference for phi-bit 2 by n permutes again components 2 and 3, leaving just the permutation of components 1 and 4. The change in state vectors for this permutation is shown below:19103238682.1085067-844959(UA24-289)
[0084] Considering the absolute value of the state vector components, we observed the permutation of the first and fourth components of that vector. Again, small variations in numerical values are resulting from the experimental noise.
[0085] 3.6 Permuting Components 2 and 4
[0086] We consider the initial state vector of a two phi-bits system with the same restrictions on / ?(1)and / ?(2)as subsection 3.4: / ?(1)e [n, 2TT] and / ?(2)e [ ~]- Eq. (7) gives the same initial state vector as in Eq. (21 ). The frequency of the driver must be tuned such that one exchanges^g(l)*=^g(2) (31)^g(2)* _ ^g(l)
[0087] This tuning transforms the state vector as shown below:
[0088] This transformation permutes the second and fourth components of the state vector which is equivalent to the unitary transformation using the matrix below:20103238682.1085067-844959(UA24-289)
[0089] This permutation is achieved by expressing / =1,2 as functions of only and using experimentally measured data of phi-bit 1 (0^'-2:>) and phi-bit 2 ( i21,2))’asshown in FIG. 7. For this permutation, the experimental phase difference for phi-bit 1 was translated with a constant to constrain the value between n and 2n. The experimental phase difference for phi-bit 2 was adjusted by a constant such that the value falls between and y. The permutation is achieved by initializing the phi-bits at frequency = 63.15 kHz and tuning the frequency to 63.70 kHz. The initial p13for phi-bit 1 is 3.72 rad and the initial13for phi-bit 2 is 3.28 rad. After this tuning, the phase differences of phi-bit 1 and phi-bit 2 are swapped so that the final phase difference for phi-bit1 is the initial phase difference for phi-bit 2 and the final phase difference for phi-bit 2 is the initial phase difference for of phi-bit 1. The change in state vectors is shown below where we observed the second and fourth components of the state vector are permuted:
[0090] Noise in the experimental data induces small variation in the numerical values of the initial and permuted state vectors.
[0091] 3.7 Cyclic Permutation Or downward shift permutation
[0092] For a cyclic permutation where all the elements of a state vector are shifted downwards, we use the same initial state vector as in subsection 3.4 (Eq. (21)) but must restrict the initial phase difference such that?(1)and?(2)are G [ y]- The driving frequency of the system must then be tuned such that the phase difference / ?(1)is exchanged with theand?(2)increases by21103238682.1085067-844959(UA24-289)
[0093] This tuning transforms the state vector as shown below.
[0094] The minus signs arise from the trigonometric relation cos ( 0 + =This transformation shifts the first three componentsdown and brings the last components to the first index which is equivalent to the unitary transformation using the matrix below.
[0095] Disregarding the phase change, one observed that we have successfully implemented a downward shift permutation of the state vector. The unitary transformation in Eq. (37) is effectively the product of a phase gate with the desired permutation gate as follows:
[0096] A cyclic permutation is implemented by expressing / =1,2 as functions of <p^'q>only and using experimentally measured data of phi-bit 1 ( i3-1)) and phi-bit 2shown in FIG. 8. Phi-bit 1 exhibits the behavior of a 7r-jump, however, the cyclic permutation requires a jump. To achieve this permutation, the22103238682.1085067-844959(UA24-289) experimental phase difference for phi-bit 1 was translated with a constant and scaled the n jump to jump by a factor of 0.5. The experimental phase difference for phi-bit 23TTwas translated with a constant such that the value lies between - and —. The2 2permutation is achieved by initializing the phi-bits at frequency fa - 62.40 kHz and tuning the frequency to 63.70 kHz. At the initial frequency, the initial pl3for phi-bit 1 is 2.32 rad, and the initial < >13for phi-bit 2 is 3.63 rad. During this tuning, the phase difference for phi-bit 1 and phi-bit 2 are exchanged such that the final phase difference for phi-bit 2 is the initial phase difference for phi-bit 1 plus radians, and the final phase difference for phi-bit 1 is the initial phase difference for phi-bit 2. The initial and final state vectors are shown below where we observed the components of the state vector have been shifted down:
[0097] The small deviation in the components of the initial and permuted state vectors are as a result of experimental noise.
[0098] 3.8 Summary of Required Initial Phases
[0099] In section 3.1 to 3.7 we demonstrated the capability of realizing all possible permutations of the components of the state vector of a two phi-bits system with a single representation of that state vector. However, the theoretical and experimental realization of these permutations imposes some constraints on the range of values that can be spanned by the phi-bit phasesThese constraints are summarized in Table 1.Table 1: Constraints imposed on the phi-bit phases require for specific permutation gate.23103238682.1085067-844959(UA24-289)
[0100] 4. SCALABLE INVERSION PERMUTATION
[0101] All the permutations implemented in section 3, are realized with a single representation of the state vector. Here, we employ a tensor productrepresentation of the state vector to implement a permutation matrix P =which inverts all the elements of the state vector. This is to show that different permutation of the state vector of N phi-bits system can be achieved using an appropriate representation and we further demonstrate the viability of achieving a scalable permutation using the same representation.
[0102] Using tensor product representation of two phi-bits described in Eq.(5) we are able to invert the entire state vector by taking the phase difference for each phi-bit throughchange.
[0103] The minus signs arise from the trigonometric relation shown in subsection 3.3. This inversion can be realized by initializing the two phi-bits state at arbitrary values and is equivalent to the unitary transformation matrix below.24103238682.1085067-844959(UA24-289)
[0104] For experimental demonstration of this inversion, we start by expressing (3^, / =1,2 as functions ofonly and using experimentally measured data of phi-bit 1 ( i2-3))andphi-bit 2 ( ^'-2)), shown in FIG. 9. We initialize the phi-bit at the frequency / j = 62.10 kH and the effect of tuning the frequency to 62.55 kHz leads to a decrease in the phase difference of phi-bit 1 and 2 by The transformation of the state vector is shown below and disregarding the sign change in V* one sees that the elements in the state vector are inverted.
[0105] Furthermore, we demonstrate the scalability of this operation by extending it to a system of three phi-bits. For this we use a tensor product representation of the state vector with the experimentally measured data of phi-bit 1 ( i2-3))’ phi-bit 2and phi-bit 2 ( i3,-1)) illustrated in FIG. 10. The frequency was again tuned from the same initial frequency of 62.10 kHz to the same final frequency of 62.55 kHz so that the phase difference for each phi-bit decreases by radians. The change in state vectors from this tuning is shown below:25103238682.1085067-844959(UA24-289)
[0106] Independently of some sign changes in Eq. (42) which arises from the trigonometric relation shown in subsection 3.3, we have successfully inverted all the components of this state vector.
[0107] Note that the three phi-bits have the same p=4 and we could use any other phi-bits by scaling. By this, we achieve a general scalable inversion for any number of phi-bits.
[0108] 5. QISKIT QUANTUM CIRCUIT COMPARISON
[0109] In this section, we compare some of the experimentally realized permutations in section 3 and 4 using phi-bits to their quantum counterparts using circuits developed with Qiskit. Qiskit is an open-source software development kit used in design and optimization of quantum circuits. We make use of the quantum simulator option of Qiskit using the available quantum gates in the python library. Operations on quantum bits are realized with quantum circuits composed of sequential single and two qubit gates. We begin with all qubits in state 10>, and for comparison purposes we proceed to initializing the state vector of the qubit system to the same state vector as the phi-bit system. While each of the qubit based permutations below requires a varying number of physical actions, each of the phi-bit based permutations is achieved using a single physical action such as tuning the driving frequency j.
[0110] The SWAP gate is a defined quantum gate in Qiskit. The corresponding circuit is made up of three sequential CNOT gates as shown in FIG. 11 (a). The circuit necessary to realize the permutation of components 2 and 4 of a two qubits state vector is illustrated in FIG. 11 (b). The circuit requires 7 sequential C-NOT gates. The Qiskit circuit for inverting a two qubit state vector uses a sequence of three C-NOT, two Pauli-X (single qubit), and two C-NOT gates as shown in FIG. 11 (c).26103238682.1085067-844959(UA24-289)
[0111] Scaling the qubit based inversion to a larger number of qubits will require an even more complicated circuit. Recall, the same phi-bit based operations require a single physical operation, illustrating the exceptional power of the phi-bit system.
[0112] 6. Non-limiting Conclusions and Observations
[0113] We describe a physical system constituted of an array of three externally driven acoustic waveguides. Logical phi-bits which are analogues of qubits appear as nonlinear modes in the system. The state of a logical phi-bit is represented on the Bloch sphere as a function of two phase differences measured between the waveguides. A modified tensor product representation of two logical phi-bit states enables us to explore conditions leading to all possible permutations (including the SWAP and C-NOT gate). These are demonstrated using experimental data from the driven system. Additionally, we have introduced and demonstrated the scalability of the inversion of the components of a 2Ndimensional state vector arising from N logical phi-bits. All these permutations are performed with the single physical action of changing the driving frequency.
[0114] Finally, we compare using logical phi-bits to their quantum counterparts in the context of the open-source software development kit; Qiskit. The result of the two approaches shows the advantage of logical phi-bits over equivalent quantum circuits. All Qiskit circuits employ a sequence of single and two qubit gates unlike logical phi-bits which perform a simultaneous permutation of state vectors with just a single physical action.
[0115] Additional advantages of the logical phi-bit approach include robustness with respect to measurement, environmental conditions, and ease of operation.
[0116] PART II: INFORMATION ENCODING AND ENCRYPTION IN ACOUSTIC ANALOGUES OF QUBITS
[0117] 1. Introductions
[0118] Protecting the confidentiality and integrity of data, as well as securing transactions and communications is crucial in government and nongovernmental organizations. Evidently, this has been accomplished by the utilization of27103238682.1085067-844959(UA24-289) cryptography, which involves the encryption and decryption of data by converting it from its original form to an unreadable format utilizing a secret key and vice versa. It addresses the issues of data leakage and ensures that only authorized individuals can access the information. It gives information immunity against attacks and unauthorized access and manipulation. Classical cryptography uses mathematical operations to encode messages and may employ two types of key encryption algorithms to encrypt and decrypt the information. The advent of quantum computers poses a significant threat to the field of cryptography due to their remarkable computing speeds and ability to decipher many encryption algorithms currently in use. However, the introduction of post-quantum cryptography (PQC) protocols, such as those based on lattice encryption, has demonstrated effectiveness in fortifying classical encryption against quantum attacks. A quantum computer leverages the ability of its processing units (qubits) to exist in the superposition of states to execute parallel computation. Quantum computers can efficiently solve mathematical problems that are computationally impractical for classical computers. This includes solving the factorization problem, which is one of the bases of classical encryption. Furthermore, it has been demonstrated that other current classical encryption systems may be bypassed using straightforward quantum techniques. The National Institute of Standards and Technology (NIST) predicts that quantum computers will render present public key encryption techniques obsolete by 2028. It is believed that further advancement in the quantum computer will totally eradicate classical encryption. In that context, researchers are focusing on postquantum cryptography (PQC) to prepare for the anticipated future risk posed by quantum computers. PQC’s objective is to create novel algorithms capable of withstanding quantum attacks, which integrate quantum algorithms into the existing classical encryption framework.
[0119] In a conventional computer, a classical bit encodes information as either a 0 or a 1, whereas, the quantum equivalent of a classical bit, qubit, can exist simultaneously in a coherent superposition of the quantum basis states |0) and |1). Even though some quantum algorithms (quantum circuits) can be efficiently simulated using classical computersError! Reference source not found., the anticipated advantage of quantum computing lies in its massively parallel processing capabilities28103238682.1085067-844959(UA24-289) associated with quantum superposition and entanglement. The quantum wavefunction represents a probability amplitude, implying that a system composed of multi-qubit systems is highly vulnerable to noise and wavefunction collapse triggered by any disturbance in the quantum system, which scales exponentially with an increase in the qubit system. This presents a significant challenge in the experimental realization of multi-qubit systems.
[0120] To address the scalability difficulties in quantum computing, inventive concepts including a method are introduced for encrypting and decrypting data using multiple logical phi-bit systems. A phi-bit is a classical analogue of a quantum bit supported by a driven acoustic metamaterial constituted of parallel acoustic waveguides. A phi-bit is specifically associated with a two-state degree of freedom of an acoustic wave, which can be in a coherent superposition of states with complex amplitude coefficients. A phi-bit like its counterpart qubit exhibits superposition and entanglement of states which is the foundation of quantum computing.
[0121] The concept of phi-bit was recently broadened from the physical to the logical domain. A logical phi-bit is conceptualized as a two-level system characterized by complex amplitudes analogous to a qubit. Notably, phi-bits co-exist in the same physical space which indicates independent of the phi-bit scalability on distance. Logical phi-bits exploit the strong coupling and nonlinearity of acoustic waves to realize non-separable superpositions of states spanning exponentially complex spaces (i.e., Hilbert space), a prerequisite to developing algorithms that exploit the computational parallelism arising from non-separability and hence can be employed for programming.
[0122] The following description includes a novel approach to data encryption utilizing logical phi-bits, which are generated through the experimental setup of three aluminum rods arranged in a linear array with transducers to drive and detect acoustic fields. These phi-bits are nonlinear vibrational modes represented by frequency and relative phases between waveguides, similar to qubits in quantum computing. The paper illustrates the simultaneous manipulation of phi-bits by controlling the conditions, enabling efficient encryption and decryption of information. The encryption process involves encoding a message into the state vector of phi-bits and applying unitary29103238682.1085067-844959(UA24-289) transformations, such as changes in driving frequencies, to effectively encrypt and decrypt the message. The scalability of the system is highlighted, with encryption processing time remaining constant regardless of the number of phi-bits used. While we recognize that an extensive security analysis, including the transmission of the message, is crucial in the field of cryptography. However, in this study, our focus is demonstrating the feasibility of an encryption scheme using a phi-bit state vector and presents logical phi-bits as a promising solution for encryption in the digital age. The security analysis is beyond the scope of this paper and will be addressed in future work. The paper concludes by emphasizing the importance of adapting cryptographic methods to advancements in technology, with logical phi-bits offering a reliable approach to strengthening data security.
[0123] 2. LOGICAL PHI-BIT AND REPRESENTATION AND PROPOSEDENCRYPTION SCHEME
[0124] A logical phi-bit was generated by replicating the experimental arrangement described in Aaronson et al. (“Aaronson, S., & Gottesman, D. (2004). “Improved simulation of stabilizer circuits.” Physical Review A, 70(5), 052328) incorporated by reference in its entirety, the setup consisted of three aluminum rods, approximately 60cm long, arranged in a linear array with a lateral gap of 2mm filled with epoxy. Transducers were used to drive and detect the acoustic field at the ends of the rods. The waveguides are labeled 1, 2, and 3, where waveguide 2 is sandwiched between waveguides 1 and 3. Two driving transducers located on waveguide 1 and waveguide 2 were excited with sinusoidal signals at the primary frequencies / j and f2, respectively. The third waveguide was not driven. The driving transducers were connected to different function generators and amplifiers and were driven with the same peak-to-peak voltage of 80V. Three detecting transducers were connected to an oscilloscope to measure the voltage (displacement field) generated at the other ends of the waveguides. The detected temporal signals are fast Fourier transformed (FFT) to produce a power spectrum. In the spectral domain, we observed strong peaks associated with the primary frequencies as well as weaker peaks associated with nonlinear vibrational modes supported by the inherently nonlinear system. A logical phi-30103238682.1085067-844959(UA24-289) bit,’ / ’, is defined as a nonlinear mode in which frequency can be written as a linear combination of the primary frequencies:F^ pfi +qfz (1)where p and q are integer coefficients.
[0125] A single logical phi-bit 7’ is characterized by its frequency but also the corresponding relative phases between the acoustic waveguides. The relative phases between waveguides 1 and 2 and between waveguides 1 and 3 at the phi-bit frequency, Fw, are written as the phase difference= <p^ -(plrespectively. Here, the phase of the nonlinear mode at the end of waveguide 1 is used as a reference.
[0126] The two-phase differences serve as degrees of freedom for representing a logical phi-bit as a two-level system that may be characterized as a 2x1 vector with complex components. Within this representation, a logical phi-bit is analogous to a qubit. Notably, logical phi-bits co-exist in the same physical space, that is, the space of the physical system. Since logical phi-bits are nonlinear vibrational modes generated from the same driving frequencies, their associated phase differences are correlated to each other. Subsequently, the two-level system representations of multiple phi-bits are also strongly correlated and can be simultaneously manipulated by tuning the driving conditions of the system. Effectively, the state of N logical phi-bits may be represented as a 2wx1 complex vector spanning an exponentially scaling space (i.e., a Hilbert space). The representation of the N phi-bit state depends on the choice of the basis of the Hilbert space. The strong nonlinear coupling between the phi-bits enables manipulation of the component of this large complex vector in a parallel manner by changing the driving conditions. Furthermore, the components of the large multi-phi-bit state vector can be used to encode information. Parallel manipulation of these components can be used to encrypt the encoded information. The inverse manipulation can also be used to decrypt the encrypted information in an efficient manner.
[0127] We illustrate this encryption method in the case of a N=5 phi-bit system. For this, the driving frequencies are taken as= 62kHz and f2= 66kHz. We31103238682.1085067-844959(UA24-289) tune by increments of Av(n) = (n - 1) * 50Hz with n G [1,81], thus spanning a range of frequency of 0 to 4kHz.
[0128] We are considering phi-bits 1 through 5 with corresponding values p and q of (5, -4), (4, -3), (-1, 2), (1, 1 ), and (4, -1 ), respectively. The phi-bits are selected at random which indicates randomness of the p and q values. In FIG. 12 (a), we report experimentally measured p^\^v~) and ^^(Av) for the five selected phi-bits. We note that the phase differences exhibit two different behaviors. The first behavior is associated with a common monotonous variation of the phase differences. The second behavior which is only occurring in the case of phi-bits 4 and 5 takes the form of sharp 180° (TT) jumps. The possible physical origin of these two behaviors has been discussed at length in relevant literature. Here we focus on the first behavior by correcting the phase differences by the n jumps to obtain continuous variations for all phi-bits.Moreover, in the case of the first behavior the phase differences of the phi-bits relate to the phase differences at the primary frequencies in a linear manner. Indeed, we can writewhere p and q are the same coefficients as in equation (1 ).
[0129] In FIG. 12 (b), we rescale the corrected phase differences of the phi-bits by the factor p only, since the <pi2( / 2) and < Pi3( / 2) remain constant. The rescaled and corrected phase differences of the five phi-bits behave simultaneously in the same manner. The vertical offset is simply due to the constant q<pi2( / 2) and w X
[0130] Each phi-bit,is represented in a two-dimensional Hilbert space, taking the form reminiscent of a Bloch sphere representation:32103238682.1085067-844959(UA24-289)
[0131] In that representation, for the sake of simplicity, we assume y = 0, and
[0132] To address the offset in the rescaled and corrected phases of FIG.12 (b) we use p^,\ v(ri = 1)) as origins as well as the reference for encoding information. In equation (4), K is a scaling factor to amplify the range spanned by <p^ For the sake of simplicity, we have madea function of (p^ only, other forms could be defined as function of cp^and <p^ offering an extra degree of freedom in the manipulation of the phi-bit state vector. At the driving frequency
[0133] Let us consider a system made of five phi-bits, we can define the state of the system as the tensor product of the phi-bits:V = I7W®lZ(2)®7 3)(g)[Z(4)0 (5) (6)
[0134] This tensor product evaluated at the reference driving frequency takes the form:
[0135] We now consider a new representation of the five phi-bit state vector,33103238682.1085067-844959(UA24-289)V = ' = [10 0 1 0 1 1 0 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0] (8) where V'T= 2 / 2VT.
[0136] This new representation of the five phi-bit state corresponds to a change of basis of the Hilbert space. While the vector V is separable, the vector V is not separable into a tensor product of single phi-bit states. In quantum information science non-separability of multiple qubit states is necessary for establishing quantum correlations between the qubits. In the case of phi-bit based information science, the components of a multi-phi-bit state vector such as equation (7) are correlated via the nonlinearity of the physical system. The string of correlated ones and zeros in V can therefore be employed to encode a message as well as encrypt that message by applying a unitary transformation on V. Here we illustrate this encryption process in the case of a short message encoded using 5 phi-bits. In general, the state vector V of a A / phi-bit system is a 2wx1 vector with 1 and 0 elements providing sufficient bits for encoding very long messages when A / is large. For instance, when A / =50 the number of bits available for encoding a message is on the order of 1015. The encryption of a message encoded on this large number of bits would only require a change in the driving condition of the array of waveguides to achieve the encrypting unitary transformation. Such an operation takes approximately a millisecond on the physical system used here, since the speed of sound in the constitutive materials is on the order of a few thousand meters per second.
[0137] 3. EXAMPLES OF MESSAGE ENCODING AND ENCRYPTION
[0138] Let us consider encoding a message such as ‘UA using our 5 phi-bits system. The message in its American Standard Code for Information Interchange (ASCII) format is 8565, which is equivalent to UA=01010101 01000001 in an 8-bit binary system. The length of the message and the number of ones and zeros in its binary representation determine the number of phi-bits needed for encoding. In this case, 5 phi-bits are sufficient to support the message successfully since the state vector V is 32 components long. FIG. 13 illustrates the encoding of the binary form of the message in the vector V by indexing some of its components. The indexing process34103238682.1085067-844959(UA24-289) involves encoding each digit of the message vector into the corresponding index in the state vector, as this encoding proceeds sequentially, any index of the state vector occupied by the message digit will become unavailable for the next digit of the message. It's important to note that this indexing is not necessarily unique and may not be consecutively ordered. The message ‘UA’ is now taking the index form: UAindex= [34 5 615 16 17 182021 2223 89 12 13],
[0139] All other components of the phi-bit state vectors are just padding the message.
[0140] To encrypt the message, we change the driving condition of the first waveguide to ( / j* = + Av(n = 20)) = 62950Hz and we use K=2.7 in the representation of equation (4). This change in driving condition is equivalent to a rotation of the vector V in the Hilbert space, that is, a unitary transformation. Using the experimentally measured rescaled and corrected= 0) to calculate the numerical value of the encrypted indexed components, we obtain the encrypted message in the form,Table 2: Encrypted message obtained with an encryption frequency of 62950 Hz
[0141] The encrypted indexed components are now decimal numbers as shown in Table 2. In quantum information science, another additional advantage of quantum computers over classical computers is the No-Cloning Theorem, which states that creating an exact copy of an unknown quantum system is impossible. This fundamental principle underscores the unique nature of quantum information and highlights the limitations imposed on information processing in quantum systems. This concept is pertinent to the phi-bit system, as it aligns with the inherent constraints and characteristics of quantum information processing, reinforcing the security and integrity of the encoding process. The recipient and the sender of the message need to have the same physical system and must agree on the phi-bit representation, and the number of phi-bits. The encrypted message is sent to the recipient in the following form: the driving35103238682.1085067-844959(UA24-289) frequency at which the message is encrypted and UAindex. This message can be sent over any type of communication channel. The recipient needs to know the key to decrypt the message, this key is effectively the change in driving frequency that is needed to read the original message. Here this key is -Av(n = 20). However, because of the possibility of small differences in the sender and recipient systems, the decrypted message may not give exact values of zeros and ones for the indexed components. In that case, the decrypted decimal values may be rounded to the nearest integer, i.e., 0 and 1. This will lead to a substantially robust method for encrypting and decrypting messages.
[0142] If we consider a recipient of the message using equipment with a noise leading to a deviation of 50Hz on the frequency of the decryption of the encrypted message, one obtains decrypted index components to within at most 25% of the original message (see Table 3). For illustrative purpose, we have used a large deviation of 50Hz from the encryption frequency. An easily achievable tighter control of the frequency, such as the one we have in our experiment (e.g., 1 Hz) leads to a very robust method of encryption.Table 3: Message obtained with a deviation of 50Hz from the encryption frequency
[0143] Small variations in <p^ constitute another possible source of noise as shown in the FIG. 12. For example, a significant variation of 5% in the <p^ of the five phi-bits leads to decrypted index component deviating from the original message by at most 10%. Since the five phi-bits exhibit the same overall scaled continuous behavior, a simple averaging scheme could be used as a correction to significantly reduce that source of noise.
[0144] We have successfully illustrated this encoding and encryption technique using a 5 phi-bits system, chosen due to the length of our message. As phi-bits occupy the same physical domain and are strongly correlated, the scalability remains unaffected by distance, the system can accommodate N phi-bits with the same36103238682.1085067-844959(UA24-289) processing time for encryption and decryption. This scalability arises from the fact that it takes the same time to tune the driving condition of the physical system. The length of messages that can be encrypted scales exponentially as 2N, this leads to a substantial advantage for large N.
[0145] 4. COMPARISON WITH CLASSICAL ENCRYPTION
[0146] The requirement for perfectly secured cryptography is that the encrypted data and the original message should be statistically independent. The correlation analysis was conducted between the original message and encrypted vector by sweeping the frequencyfrom 62kHz to 64kHz. This analysis shows the nonsignificance of the vector (p >0.05). A p-value below the conventional threshold of 0.05 indicates a lack of statistical significance between the encoded vector (original message) and the encrypted matrix. This observation highlights the efficacy of our encryption system, confirming the ability to preserve the confidentiality of the original message without introducing patterns discernable using cryptanalysis like linear and differential cryptanalysis. Additionally, this means that the encrypted matrix passed the statistical test of randomness, it is unpredictable and can be reproduced reliably (i.e. running the experiment with the same conditions leads to only small variations in the encrypted data).
[0147] In the concept of classical cryptography, unicity distance is defined as the least number of encrypted data needed for an intruder to estimate the encryption key successfully. The perfect secrecy condition states that the entropy (uncertainty in information) of the key must be greater than that of the message. Here, the length of the message and the change in the driving condition of the system (key) are completely independent. It will only take a sweep of the frequency out of many possible options for N length of data. Consequently, the key is independent of the original message and the cipher text. Also, the indexing of the state vector is not unique and the chances of an eavesdropper with a classical computing power to predict the exact 2Nvector used for the encryption is 1 out of 2N. This will pose a great challenge for eavesdroppers with classical power even if they have much information about the cipher text.
[0148] 5. Non-limiting Conclusions and Observations37103238682.1085067-844959(UA24-289)
[0149] The inventive concepts of Part II illustrate the crucial requirement for strong data security in governmental and non-governmental sectors, especially with the rise of quantum computing risks. Classical cryptography has been a fundamental method for protecting confidential data by using encryption methods based on mathematical operations and secret keys. The rapid progress of quantum computing technology presents substantial challenges to classical encryption systems, as quantum computers have the capability to break modern encryption schemes that are now deemed secure.
[0150] The idea of logical phi-bits is presented, utilizing the inherent nonlinearity acoustic waves in externally driven waveguides to create a scalable and versatile encryption system. Logical phi-bits, nonlinear acoustic waves, operate on principles similar to qubits in quantum computing and have the potential to transform encryption techniques by providing strongly correlated superpositions of states in the same physical domain.
[0151] The viability of using multiple logical phi-bits for data encryption using a 5 phi-bit system is demonstrated. We achieve efficient encryption and decryption operations by manipulating the state vectors representing phi-bits superpositions through controlled changes in driving frequencies. Additionally, this research shows that the encryption processing time is constant and independent of the number of phi-bits considered for encryption. In this study, we focused on demonstrating the feasibility of an encryption scheme using a phi-bit state vector, while a comprehensive security analysis, including the transmission of the message, is recognized as crucial in the field of cryptography but remains beyond the scope of this paper and will be addressed in future work. Furthermore, our methodology allows for additional research in enhancing encryption methods through permutations of the state vector product to encode the message within the initial portion of the state vector, which could lead to the elimination of sending message indices between sender and recipient. With permutations, the challenge for a classical computer scale like 2N! rather than simply 2Na truly daunting challenge. As quantum computing technologies advance, it is crucial for cryptographic methods to adjust correspondingly. By utilizing logical phi-bits,38103238682.1085067-844959(UA24-289) one can strengthen data security at speeds and scales comparable to quantum information modalities without suffering from the fragility inherent in quantum systems.
[0152] It should be understood from the foregoing that, while particular embodiments have been illustrated and described, various modifications can be made thereto without departing from the spirit and scope of the invention as will be apparent to those skilled in the art. Such changes and modifications are within the scope and teachings of this invention as defined in the claims appended hereto.39103238682.1
Claims
085067-844959(UA24-289)CLAIMSWhat is claimed is:
1. A system, comprising:a processor in communication with a memory, a plurality of driving transducers coupled to an array of acoustically coupled waveguides, and a plurality of detecting transducers coupled to the array of acoustically coupled waveguides, the memory including instructions executable by the processor to:determine an input multi phi-bit value based on first detected signals measurable at the plurality of detecting transducers, the input multi phi-bit value being defined in terms of a modified tensor product representation of an initial phase difference between two or more waveguides of the array of acoustically coupled waveguides, the initial phase difference corresponding with a logical phi-bit value of the input multi phi-bit value;apply, by the plurality of driving transducers coupled to the array, a change in driving conditions that induces a targeted phase jump rotation operation and results in second detected signals measurable at the plurality of detecting transducers that correlate with an output multi phi-bit value, the targeted phase jump rotation operation being selected based on a selected permutation operation to be applied to one or more components of the input multi phi-bit value; anddetermine the output multi phi-bit value based on the second detected signals and the modified tensor product representation with respect to the input multi phi-bit value, the output multi phi-bit value correlating with a result of the targeted phase jump rotation operation on the input multi phi-bit value and a result of the selected permutation operation on the input multi phi-bit value.40103238682.1085067-844959(UA24-289)2. The system of claim 1, the memory including instructions executable by the processor to:translate, prior to application of the change in driving conditions and based on the selected permutation operation, the initial phase difference of one or more logical phi-bit values of the input multi phi-bit value to be within a restricted phase range.
3. The system of claim 1, the input multi phi-bit value including a message payload and the output multi phi-bit value including an encrypted message payload.
4. The system of claim 3, the memory including instructions executable by the processor to:append driving condition information to the encrypted message payload; and transmit an encrypted message to a receiving device, the encrypted message including the encrypted message payload and the driving condition information.
5. The system of claim 1, the input multi phi-bit value including an encrypted message payload and the output multi phi-bit value including a decrypted message payload.
6. The system of claim 5, the memory including instructions executable by the processor to:access driving condition information from an encrypted message, the encrypted message further including the encrypted message payload; and decrypt the encrypted message based on the driving condition information.
7. The system of claim 5, the memory including instructions executable by the processor to:evaluate the decrypted message payload by application of a rounding operation to the output multi phi-bit value.41103238682.1085067-844959(UA24-289)8. The system of claim 1, the modified tensor product representation incorporating a tensor product of a modified Bloch sphere representation of each respective logical phi-bit value of the input multi phi-bit value, the modified Bloch sphere representation of a state of a logical phi-bit value being defined as:the logical phi-bit value correlating with a characteristic frequency= pf + qf2having driving conditions corresponding with a driving frequency f₁ and a fixed frequency f2applied by the plurality of driving transducers coupled to the array; and the modified Bloch sphere representation including a first degree of freedom β and a second degree of freedom γ that incorporate phase differences between each acoustically coupled waveguide of the array of acoustically coupled waveguides.42103238682.1
