5 citations · 7 across the 3 of their papers we have counts for
6 papers
Topologically protected Grover's oracle for the partition problem
Nikolai A. Sinitsyn, Bin Yan
The Number Partitioning Problem (NPP) is one of the NP-complete computational problems. Its definite exact solution generally requires a check of all solution candidates, which…
Randomized channel-state duality
Bin Yan, Nikolai A. Sinitsyn
Channel-state duality is a central result in quantum information science. It refers to the correspondence between a dynamical process (quantum channel) and a static quantum state i…
An adiabatic oracle for Grover's algorithm
Bin Yan, Nikolai A. Sinitsyn
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of th…
Redundantly amplified information suppresses quantum correlations in many-body systems
D. Girolami, A. Touil, B. Yan +2
We establish bounds on quantum correlations in many-body systems. They reveal what sort of information about a quantum system can be simultaneously recorded in different parts of i…
Benchmarking Information Scrambling
Joseph Harris, Bin Yan, Nikolai A. Sinitsyn
Information scrambling refers to the rapid spreading of initially localized information over an entire system, via the generation of global entanglement. This effect is usually det…
Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
Bin Yan, Nikolai A. Sinitsyn
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow t…