Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Rethinasamy, Soorya"'
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 simplify learning parameters in machine learning applications, and cert
Externí odkaz:
http://arxiv.org/abs/2407.17563
Publikováno v:
Phys. Rev. A 110, 052401 (2024)
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 space of the form $\mathcal{H} = (\mathbb{C}_2)^{\otimes n}$, or an $n$-q
Externí odkaz:
http://arxiv.org/abs/2404.07151
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-nucleus simulations with general potentials, which provides acceptable bound
Externí odkaz:
http://arxiv.org/abs/2402.14680
Autor:
Chen, Jingxuan, Westerheim, Hanna, Holmes, Zoë, Luo, Ivy, Nuradha, Theshani, Patel, Dhrumil, Rethinasamy, Soorya, Wang, Kathie, Wilde, Mark M.
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 optimization problems including semi-definite programming (SDP) and linear progra
Externí odkaz:
http://arxiv.org/abs/2312.03830
Autor:
Westerheim, Hanna, Chen, Jingxuan, Holmes, Zoë, Luo, Ivy, Nuradha, Theshani, Patel, Dhrumil, Rethinasamy, Soorya, Wang, Kathie, Wilde, Mark M.
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 computers become more powerful and go beyond the reach of cla
Externí odkaz:
http://arxiv.org/abs/2312.03083
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 several complexity-theoretic results that classify the difficulty of sy
Externí odkaz:
http://arxiv.org/abs/2309.10081
Publikováno v:
Quantum 8, 1366 (2024)
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 the separability of a general bipartite state by using the quantum steer
Externí odkaz:
http://arxiv.org/abs/2303.07911
Publikováno v:
Physical Review A, vol. 108, no. 1, page 012409, July 2023
The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol is from the ideal case. The most prominent distinguishability measure
Externí odkaz:
http://arxiv.org/abs/2108.08406
Publikováno v:
Quantum 7, 1120 (2023)
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 tasks. For example, states that commute with a Hamiltonian realizing a
Externí odkaz:
http://arxiv.org/abs/2105.12758
Autor:
Rethinasamy, Soorya, Wilde, Mark M.
Publikováno v:
Phys. Rev. Research 2, 033455 (2020)
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 one pair to the other. In this work, we reframe this question in such
Externí odkaz:
http://arxiv.org/abs/1912.04254