34 citations · 112 across the 14 of their papers we have counts for
14 papers
Verifiable Random Sampling
Yeoh Wei Zhu, Soorya Rethinasamy, Anthony Alexiades Armenakas +3
Verifiable random functions (VRF) underpin a wide range of applications that require publicly verifiable evaluations of a pseudorandom function on a given input. However, once the…
Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
Michele Minervini, Madison Chin, Jacob Kupperman +6
A quantum thermodynamic system is described by a Hamiltonian and a list of conserved, non-commuting charges, and a fundamental goal is to determine the minimum energy of the system…
Efficacious qubit mappings for quantum simulations of the C rotational band
Darin C. Mumma, Zhonghao Sun, Alexis Mercenne +3
Solving atomic nuclei from first principles places enormous demands on computational resources, which grow exponentially with increasing number of particles and the size of the spa…
Quantum Algorithms for Realizing Symmetric, Asymmetric, and Antisymmetric Projectors
Margarite L. LaBorde, Soorya Rethinasamy, Mark M. Wilde
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or s…
Logarithmic-Depth Quantum Circuits for Hamming Weight Projections
Soorya Rethinasamy, Margarite L. LaBorde, Mark M. Wilde
A pure state of fixed Hamming weight is a superposition of computational basis states such that each bitstring in the superposition has the same number of ones. Given a Hilbert spa…
Neutron-nucleus dynamics simulations for quantum computers
Soorya Rethinasamy, Ethan Guo, Alexander Wei +2
With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron-nucleu…
QSlack: A slack-variable approach for variational quantum semi-definite programming
Jingxuan Chen, Hanna Westerheim, Zoë Holmes +6
Solving optimization problems is a key task for which quantum computers could possibly provide a speedup over the best known classical algorithms. Particular classes of optimizatio…
Dual-VQE: A quantum algorithm to lower bound the ground-state energy
Hanna Westerheim, Jingxuan Chen, Zoë Holmes +6
The variational quantum eigensolver (VQE) is a hybrid quantum-classical variational algorithm that produces an upper-bound estimate of the ground-state energy of a Hamiltonian. As…
Quantum Computational Complexity and Symmetry
Soorya Rethinasamy, Margarite L. LaBorde, Mark M. Wilde
Testing the symmetries of quantum states and channels provides a way to assess their usefulness for different physical, computational, and communication tasks. Here, we establish s…
Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
Aby Philip, Soorya Rethinasamy, Vincent Russo +1
Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies th…
Estimating distinguishability measures on quantum computers
Soorya Rethinasamy, Rochisha Agarwal, Kunal Sharma +1
The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol…
Testing symmetry on quantum computers
Margarite L. LaBorde, Soorya Rethinasamy, Mark M. Wilde
Symmetry is a unifying concept in physics. In quantum information and beyond, it is known that quantum states possessing symmetry are not useful for certain information-processing…
Relative Entropy and Catalytic Relative Majorization
Soorya Rethinasamy, Mark M. Wilde
Given two pairs of quantum states, a fundamental question in the resource theory of asymmetric distinguishability is to determine whether there exists a quantum channel converting…
Universality in Distribution of Monogamy Scores for Random Multiqubit Pure States
Soorya Rethinasamy, Saptarshi Roy, Titas Chanda +2
Monogamy of quantum correlations provides a way to study restrictions on their sharability in multiparty systems. We find the critical exponent of these measures, above which rando…