Today Physical Superintelligence PBC is announcing a proof of the Aaronson-Ambainis conjecture, one of the central open problems in quantum complexity, with major implications for quantum computing speedup.
https://t.co/sAewkKdSOu
Thread 👇
📢Postdoc opportunities in quantum computing at Kyung Hee University, Seoul!
My new research group in the Department of Physics launches in 2027!
Join as an early member, help shape our research direction, and pursue your own ideas 😁
⬇️More info
https://t.co/Htm489DGhl
🔥New paper out! : “Dynamical quantum simulations as laboratories for quantum information.”
https://t.co/Xx5AbLY705
A simulation built to compute a response function prepares many-body states with much more to tell us!
(1/5)
🤔 A surprise: the XX chain has a compact fermionic description, yet simple spin measurements recover a larger fraction of locally available information in the XXX chain!
How simply we describe a state and how easily we read it out are different questions.
(4/5)
🚀New Paper Out
"The cost of simulating classically tractable quantum circuits and dynamics."
https://t.co/dhZSNaNEHI
Classical simulability with poly resources is often regarded to be efficient. But is this true when we consider actual wall-clock time and monetary cost?
Interestingly, we identify regimes in which Classical Simulation is slower in wall-clock time despite requiring only polynomial resources. Even when Classical Simulation is faster, it is not necessarily cheaper because of the quantum data acquisition that may be required
Extremely proud to see our paper "Quantum Convolutional Neural Networks are Effectively Classically Simulable" published in @PRX_Quantum
https://t.co/1UGukJYQLv
This is an instantiation of our work, provable absence of barren plateaus implies classical simulability.
Huge thanks to my co-authors @MartinLaroo and @MvsCerezo !
If you're attending the APS Global Physics Summit, we’d be happy to see you at our talk:
🗓️ Tuesday, March 17
⏰ 9:12 AM
📍Mile High Ballroom 1D
🚀 New paper out!
Happy to share our latest work:
“A Practical Framework for Simulating Permutation-Equivariant Quantum Circuits.”
https://t.co/m8RxNis1SJ
This work introduces a practical classical simulation framework for permutation-equivariant quantum circuits with runtime scaling O(n⁴), improving upon previous methods.
To demonstrate its practicality, we simulate circuits with up to 512 qubits, running in under 2 minutes.
Have you ever wondered how much work can be offloaded from quantum computers when simulating an expectation landscape of a parametrized quantum circuit🤔? In our new work “Efficient quantum-enhanced classical simulation for patches of quantum landscapes” we tackle this question.