Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Henderson, Jessie M."'
Several cryptographic systems depend upon the computational difficulty of reversing cryptographic hash functions. Robust hash functions transform inputs to outputs in such a way that the inputs cannot be later retrieved in a reasonable amount of time
Externí odkaz:
http://arxiv.org/abs/2404.17142
Autor:
Henderson, Elena R., Henderson, Jessie M., Shahoei, Hiva, Oxford, William V., Larson, Eric C., MacFarlane, Duncan L., Thornton, Mitchell A.
Physically unclonable functions (PUFs) are designed to act as device 'fingerprints.' Given an input challenge, the PUF circuit should produce an unpredictable response for use in situations such as root-of-trust applications and other hardware-level
Externí odkaz:
http://arxiv.org/abs/2404.02440
Autor:
Henderson, Jessie M., Henderson, Elena R., Harper, Clayton A., Shahoei, Hiva, Oxford, William V., Larson, Eric C., MacFarlane, Duncan L., Thornton, Mitchell A.
Physically unclonable functions (PUFs) identify integrated circuits using nonlinearly-related challenge-response pairs (CRPs). Ideally, the relationship between challenges and corresponding responses is unpredictable, even if a subset of CRPs is know
Externí odkaz:
http://arxiv.org/abs/2403.01299
Quantum algorithms provide an exponential speedup for solving certain classes of linear systems, including those that model geologic fracture flow. However, this revolutionary gain in efficiency does not come without difficulty. Quantum algorithms re
Externí odkaz:
http://arxiv.org/abs/2310.02479
Autor:
Henderson, Elena R., Henderson, Jessie M., Sinha, Aviraj, Larson, Eric C., Thornton, Mitchell A.
The quantum computer has become contemporary reality, with the first two-qubit machine of mere decades ago transforming into cloud-accessible devices with tens, hundreds, or -- in a few cases -- even thousands of qubits. While such hardware is noisy
Externí odkaz:
http://arxiv.org/abs/2309.01028
Autor:
Henderson, Jessie M., Henderson, Elena R., Sinha, Aviraj, Thornton, Mitchell A., Miller, D. Michael
Several prominent quantum computing algorithms--including Grover's search algorithm and Shor's algorithm for finding the prime factorization of an integer--employ subcircuits termed 'oracles' that embed a specific instance of a mathematical function
Externí odkaz:
http://arxiv.org/abs/2304.03829
Autor:
Sinha, Aviraj, Henderson, Elena R., Henderson, Jessie M., Larson, Eric C., Thornton, Mitchell A.
Random number generators (RNG) are essential elements in many cryptographic systems. True random number generators (TRNG) rely upon sources of randomness from natural processes such as those arising from quantum mechanics phenomena. We demonstrate th
Externí odkaz:
http://arxiv.org/abs/2304.03830
Emerging quantum algorithms that process data require that classical input data be represented as a quantum state. These data-processing algorithms often follow the gate model of quantum computing--which requires qubits to be initialized to a basis s
Externí odkaz:
http://arxiv.org/abs/2211.09860
Autor:
Henderson, Jessie M., Podzorova, Marianna, Cerezo, M., Golden, John K., Gleyzer, Leonard, Viswanathan, Hari S., O'Malley, Daniel
Publikováno v:
Sci Rep 13, 2906 (2023)
Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approac
Externí odkaz:
http://arxiv.org/abs/2210.11685
A near-term quantum algorithm for solving linear systems of equations based on the Woodbury identity
Autor:
O'Malley, Daniel, Henderson, Jessie M., Pelofske, Elijah, Greer, Sarah, Subasi, Yigit, Golden, John K., Lowrie, Robert, Eidenbenz, Stephan
Quantum algorithms for solving linear systems of equations have generated excitement because of the potential speed-ups involved and the importance of solving linear equations in many applications. However, applying these algorithms can be challengin
Externí odkaz:
http://arxiv.org/abs/2205.00645