System and Method for Mitigating Key-Exhaustion in A Key Distribution Protocol

A system and method are provided for mitigating key-exhaustion attacks in a key exchange protocol. The method includes computationally confirming an exchange of key bits has provided fresh shared key material before information theoretically confirming the exchange of key bits has provided fresh shared key material, while maintaining synchronization between messaging parties. In one implementation, maintaining synchronization includes updating keys in between each post-processing message session and managing a local state of each messaging party in the key exchange protocol prior to sending a next post-processing message. In another implementation, maintaining synchronization includes hiding a message containing the information theoretic authenticator by executing a decoy authentication process, prior to using an information theoretical key.

System and Method for Optimizing Quantum Circuit Synthesis

A method is provided for synthesizing quantum circuits while reducing the T-count, comprising, for a plurality of qubits: determining a target unitary and executing a set of candidate operations W with a single T gate and computing a specific function f of U W −1 keeping the values of W that correspond to specific multiplicities such that after the first collection of W operators is selected a collection of unitaries U W −1 is determined to consider in the next round to build a tree. A method of synthesizing quantum circuits while reducing the T-depth is also provided, comprising, for a plurality of qubits: determining a target unitary and execute a set of candidate operations W with T depth of one and computing a specific function f of U W −1 , keeping the values of W that correspond to specific multiplicities such that after the first collection of W operators is selected a collection of unitaries U W −1 is determined to consider in the next round to build a tree. A method of re-synthesizing quantum circuits while reducing T-depth is also provided, comprising, for a plurality of qubits considering all cluster sizes up to a maximum sized cluster, and continuing recursively.

System and Method for Reducing CNOT Count in Clifford+T Circuits on Connectivity Constrained Architectures

The present application recognizes the problem of reducing the CNOT-count in Clifford+ T circuits on connectivity constrained architectures. Here, one can “slice” the circuit at the position of Hadamard (H) gates and “build” the intermediate portions. Two kinds of partitioning are evaluated, namely: (i) a simple method of partitioning the gates of the input circuit based on the locality of H gates, and (ii) a second method of partitioning the phase polynomial of the input circuit. The intermediate {CNOT, T} sub-circuits can be synthesized using Steiner trees, similar to the work of Nash, Gheorghiu, Mosca [NGM20] and Kissinger, de Griend [KdG19]. The following algorithms have certain procedural differences that also help to further reduce the CNOT-count. The performances of the algorithms are compared while mapping different benchmark circuits as well as random circuits to some popular architectures like 9-qubit square grid, 16-qubit square grid, Rigetti 16qubit Aspen, 16-qubit IBM QX5, ...

Quantum Circuit Synthesis Using Deterministic Walks

There is provided a method for implementing an algorithm for forming, or synthesizing, quantum circuits on a system capable of performing the quantum circuit synthesis by using a deterministic walk (i.e. a pseudo-random walk with a random or pseudo-random starting point). In one implementation, the deterministic walk is performed using a parallel search algorithm. In an implementation of the parallel search algorithm, a user utilizes a programming language to write instructions for a compiler. Then, a meet in the middle approach is utilized to separate the circuit into two halves. Next, the parallel search technique is used to find a claw, or a pair, which satisfies the circuit analysis. Subsequently there is the production of a result and/or a synthesis of the circuit if the pair is found. 1. A method for implementing an algorithm for synthesizing quantum circuits , the method comprising:performing one or more deterministic walks on a search space; andperforming a circuit synthesis according to results of the one or more deterministic walks.2. The method of claim 1 , wherein a starting point for the one or more deterministic walks is chosen randomly.3. The method of claim 1 , further comprising determining a plurality of search spaces.4. The method of claim 3 , wherein there are two search spaces.5. The method of claim 4 , wherein the two spaces are of equal size.6. The method of claim 1 , wherein a meet in the middle algorithm is used.7. The method of claim 1 , wherein the one or more deterministic walks are performed in parallel.8. The method of claim 7 , wherein the parallel search comprises a mapping from unitary matrices to binary strings.9. The method of claim 7 , wherein the parallel search comprises a step of generating a list of distinguished points.10. The method of claim 1 , wherein the circuit synthesis comprises a step of finding a list of unitary matrices having a product within an error tolerance of a given value.11. The method of claim 10 , wherein ...

METHOD FOR DECREASING ENTROPY IN A QUANTUM SYSTEM

A method for decreasing entropy in a system includes iteratively applying a set of electromagnetic (EM) pulses to the system, the set of EM pulses effect swaps between the following pairs of system energy levels: a first system energy level in which the reset system is in a lowest energy level and the target system is in a first target system energy level that is not a lowest energy level, and a corresponding second system energy level in which the reset system is in a highest energy level and the target system is in a second target system energy level that is next lowest in energy after the first target system energy level, and waiting a time period.

System and Method for Mitigating Key-Exhaustion in A Key Distribution Protocol

Quantum Key Exchange (QKE, also known as Quantum Key Distribution or QKD) allows communicating parties to securely establish cryptographic keys. It is a well-established fact that all QKE protocols require that the parties have access to an authentic channel. Without this authenticated link, QKE is vulnerable to man-in-the-middle attacks. Overlooking this fact results in exaggerated claims and/or false expectations about the potential impact of QKE. In this paper we present a systematic comparison of QKE with traditional key establishment protocols in realistic secure communication systems.

Decoding-Based Method for Quantum Circuit Optimization

Quantum circuits include quantum gates that require a certain amount of physical resources. It is desirable to reduce the number of certain quantum gates in order to improve the hardware efficiency of a quantum circuit. A system and a method are provided for synthesizing a quantum circuit that includes the operations of determining an ordered set or vector of phase coefficients and specifying a linear permutation. The operations also include determining a sequence of CNOT and Rz gates using the set of phase coefficients and the linear permutation, such that the number of Rz gates is reduced. 1. A method for synthesizing a quantum circuit comprising the steps of:a. Determining an ordered set or vector of phase coefficients,b. Specifying a linear permutation,{'sub': Z', 'Z, 'c. Determining a sequence of CNOT and Rgates using the set of phase coefficients and the linear permutation, such that the number of Rgates is minimized.'}2. The method of claim 1 , further comprising the step of:a. Replacing said first set of phase coefficients with a second set of phase coefficients, wherein the first set of phase coefficients and the second set of phase coefficients represent the same quantum operation,{'sub': 'Z', 'b. reducing the number of Rgates required.'}3. The method of claim 2 , further comprising the use of a decoding algorithm to determine said second set of phase coefficients.4. A method for optimizing a quantum circuit claim 1 , expressed as a sequence of CNOT and Rgates claim 1 , wherein the circuit is first analyzed to obtain a set of phase coefficients and a linear permutation claim 1 , and then the method of is utilized to synthesize a new circuit.5. The method of claim 4 , wherein a Reed-Muller decoding method is utilized to determine an alternate set of phase coefficients minimizing the number of Rgates required.6. The method of claim 5 , wherein the Reed-Muller decoder is used to decode the binary residue of the set of phase coefficients claim 5 , the result ...

Quantum circuit synthesis using deterministic walks

There is provided a method for implementing an algorithm for forming, or synthesizing, quantum circuits on a system capable of performing the quantum circuit synthesis by using a deterministic walk (i.e. a pseudo-random walk with a random or pseudo-random starting point). In one implementation, the deterministic walk is performed using a parallel search algorithm. In an implementation of the parallel search algorithm, a user utilizes a programming language to write instructions for a compiler. Then, a meet in the middle approach is utilized to separate the circuit into two halves. Next, the parallel search technique is used to find a claw, or a pair, which satisfies the circuit analysis. Subsequently there is the production of a result and/or a synthesis of the circuit if the pair is found.

System and method for mitigating key-exhaustion in a key distribution protocol

A system and method are provided for mitigating key-exhaustion attacks in a key exchange protocol. The method includes computationally confirming an exchange of key bits has provided fresh shared key material before information theoretically confirming the exchange of key bits has provided fresh shared key material, while maintaining synchronization between messaging parties. In one implementation, maintaining synchronization includes updating keys in between each post-processing message session and managing a local state of each messaging party in the key exchange protocol prior to sending a next post-processing message. In another implementation, maintaining synchronization includes hiding a message containing the information theoretic authenticator by executing a decoy authentication process, prior to using an information theoretical key.

SYSTEM AND DEVICE FOR COMMUNICATION WITH A GROUP OF TRAVELERS

Decoding-based method for quantum circuit optimization

Quantum circuits include quantum gates that require a certain amount of physical resources. It is desirable to reduce the number of certain quantum gates in order to improve the hardware efficiency of a quantum circuit. A system and a method are provided for synthesizing a quantum circuit that includes the operations of determining an ordered set or vector of phase coefficients and specifying a linear permutation. The operations also include determining a sequence of CNOT and Rz gates using the set of phase coefficients and the linear permutation, such that the number of Rz gates is reduced.

Method for signal suppression by increasing entropy and quantum algorithm

A method for signal suppression by increasing entropy in a system includes iteratively applying a set of electromagnetic (EM) pulses to the system, the set of EM pulses effecting swaps between the following pairs of system energy levels: a first system energy level in which the reset system is in a highest energy level and the target system is in a lowest target system energy level, and a corresponding second system energy level in which the reset system is in a highest energy level and the target system is in a highest target system energy level, and waiting a time period. This will suppress the signal of the target element. This for example can be a signal of a solvent in NMR.

System and method for mitigating key-exhaustion in a key distribution protocol

A system and method are provided for mitigating key-exhaustion attacks in a key exchange protocol. The method includes computationally confirming an exchange of key bits has provided fresh shared key material before information theoretically confirming the exchange of key bits has provided fresh shared key material, while maintaining synchronization between messaging parties. In one implementation, maintaining synchronization includes updating keys in between each post-processing message session and managing a local state of each messaging party in the key exchange protocol prior to sending a next post-processing message. In another implementation, maintaining synchronization includes hiding a message containing the information theoretic authenticator by executing a decoy authentication process, prior to using an information theoretical key.

System and method for mitigating key-exhaustion in a key distribution protocol

Multimodal cryptographic system, computer executable instructions and method

A method, system and computer readable medium for establishment of cryptographic secrets is disclosed. Illustratively, the method includes obtaining a first input share based on a hybrid key establishment method, obtaining a second input share from a key distribution network, and deriving, from the first input share and the second input share, a shared secret for use in cryptographic communication between an initiator and a respondent.