12 papers
Solving the Shortest Vector Problem in Time via Mid-point Hessian
Minki Hhan
We present randomized algorithms for the shortest vector problem (SVP). For the -dimensional lattice , our algorithms solve SVP in time classicall…
Scalable Enumeration of Pareto-optimal Polymers for Computing Equilibrium Concentrations
Archit Patil, Minki Hhan, David Soloveichik
Predicting equilibrium concentrations of molecular complexes is essential for verifying the behavior of engineered DNA systems. However, a finite set of monomer types can in princi…
On Limits on the Provable Consequences of Quantum Pseudorandomness
Samuel Bouaziz--Ermann, Minki Hhan, Garazi Muguruza +1
There are various notions of quantum pseudorandomness, such as pseudorandom unitaries (PRUs), pseudorandom state generators (PRSGs) and pseudorandom function-like state generators…
Shallow quantum circuit for generating extremely low-entangled approximate state designs
Wonjun Lee, Minki Hhan, Gil Young Cho +1
Random quantum states have various applications in quantum information science. We discover a new ensemble of quantum states that serve as an -approximate state -design whil…
Proofs of quantum memory
Minki Hhan, Tomoyuki Morimae, Yasuaki Okinaka +1
With the rapid advances in quantum computer architectures and the emerging prospect of large-scale quantum memory, it is becoming essential to classically verify that remote device…
Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
Hamidreza Akef, Minki Hhan, David Soloveichik
Computing equilibrium concentrations of molecular complexes is generally analytically intractable and requires numerical approaches. In this work we focus on the polymer-monomer le…