Martin Larocca
@MartinLaroo
Followers
917
Following
845
Media
28
Statuses
175
Staff Scientist at Los Alamos National Laboratory --Quantum Algorithms, Quantum Machine Learning.
Los Alamos, NM
Joined March 2011
RT @Nahuel_L_Diaz: New work on Quantum resource theories! . A big thanks to my collaborators @QuAntonioMele @Berm….
arxiv.org
In quantum resource theories (QRTs) certain quantum states and operations are deemed more valuable than others. While the determination of the ``free'' elements is usually guided by the...
0
6
0
RT @MvsCerezo: 🚨Excited to share our new paper Characterizing quantum resourcefulness via group-Fourier decompositions from last year's LAN….
0
4
0
Generate videos in just a few seconds. Try Grok Imagine, free for a limited time.
528
1K
6K
The results apply to essentially any protocol based on randomized group actions, and is thus broadly relevant in certification, benchmarking, tomography and other tasks. Its important to note our results assume ensembles of circuits with gates in G (which is almost exclusively.
0
0
1
I want to sincerely thank my co-authors @MvsCerezo Diego Garcia-Martin, Nahuel Diaz and, especially, the first author and main contributor of this paper Max West.
2
0
4
These results have obvious implications for many proposed classical shadow tomography protocols, for example matchgate shadows (: they require 'deep' (linear-depth) circuits. Given these were proposed to alleviate sample-complexity with respect to.
arxiv.org
"Classical shadows" are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state [Nature Physics 16, 1050-1057]. Here, we analyze...
1
0
3
In particular, we find (see table): no mixed-unitary one-designs, orthogonal/symplectic/matchgate 2-designs, and Clifford 8-designs can be achieved in sublinear depth with local gates. These findings imply many known (and some new) constructions are depth-optimal.
1
0
3
In this work, we derive general no-go theorems that rule out the existence of group designs with certain restrictions, e.g. depth or gate-count. Our results are based on a channel discrimination setting and apply to a wide class of groups including the symplectic unitaries,
1
0
5
This question was originally raised in Schuster, Haferkamp and Huang's paper. They gave an argument ruling out short-depth designs for the orthogonal group and left it as an open question wether other groups, in particular 'fermionic, bosonic, and Hamiltonian systems' would allow.
1
0
5
How fast can quantum circuits compile group designs? Recent work showed that designs over the n-qubit unitary group can be compiled in logarithmic-in-n depth. Can we similarly build short-depth designs over other groups? In a new paper.
arxiv.org
We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $\log n$ depth. In a similar manner, we construct pseudorandom...
2
6
30
RT @MvsCerezo: This is an extremely cool paper from our summer school! If you missed it, and want the tldr, LANL recently put out a press….
lanl.gov
As quantum computing develops, scientists are working to identify tasks for which quantum computers have a clear advantage over classical computers.
0
1
0
RT @MvsCerezo: 🎉I am very happy to see our Barren Plateau Review published in Nature Review Physics. This article condenses 6 years of our….
nature.com
Nature Reviews Physics - Barren plateaus are widely considered as one of the main limitations for variational quantum algorithms. This Review summarizes the latest understandings of barren...
0
12
0
RT @alicewithoutbob: Can I interest you in a new BQP-complete problem? It's about huge interferometers. Proud to see our paper published in….
journals.aps.org
We introduce a framework for simulating, on an ($n+1$)-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over ${2}^{n}$ modes. Specifically, we encode the initial...
0
3
0
RT @MvsCerezo: 🚨Applications for LANL's 2025 Quantum Computing Summer School are open!. Please apply here.👇. Repost….
0
34
0
RT @QuAntonioMele: New paper out, directly by the @LosAlamosNatLab summer school! . We analyze classical shadows with respect to the orthog….
0
3
0
RT @qZoeHolmes: We’re looking for a post doc to join us exploring the intersection of quantum chemistry and quantum computing . - 2 year p….
0
42
0
RT @MvsCerezo: 🚨 New Summer School paper:. 👉Random ensembles of symplectic and unitary states are indistinguishable 👈..
0
6
0
RT @BermeQP: Are you interested in Quantum Convolutional Neural Networks? . What if they were indeed… classically simulable? .https:….
arxiv.org
Quantum Convolutional Neural Networks (QCNNs) are widely regarded as a promising model for Quantum Machine Learning (QML). In this work we tie their heuristic success to two facts. First, that...
0
16
0
Happy to share that our proof of the barren plateau - Lie algebra conjecture is now published on Nature Communications! Huge thanks to the team @MvsCerezo @michael_ragone_ @fredericsauv @KemperLab Bojko and Carlos!
1
16
91