Advertisement · 728 × 90

Posts by PJ

🚨 Just a couple weeks to go! 🚨
The QCTiP Conference kicks off April 23rd — where the brightest minds in quantum computing theory & practice collide ⚛️
#QCTiP2025 #QuantumComputing #CountdownBegins
🧵(1/4)

1 year ago 2 1 1 0
Preview
Registrations Registrations Registrations close: 14 March To register please create an account on our ConfTool portal, accessible through the link below (or use the same account you created for submissions of ta…

🚨The registration deadline for #QCTiP2025 in Berlin is this Friday! Don't miss out—secure your spot now: qctip2025.com/registration... 🎟️

1 year ago 3 2 0 0
Preview
Registrations Registrations Registrations close: 14 March To register please create an account on our ConfTool portal, accessible through the link below (or use the same account you created for submissions of ta…

Registrations are now open for #QCTiP2025: qctip2025.com/registration....
Don’t wait too long—spots for participants without a talk are first-come, first-served!

1 year ago 5 2 0 2

I believe this is mainly because on StackExchange there's a competition to write clearly and concisely. If you don’t answer a question clearly and concisely, someone else will. In contrast, academic papers have less incentive for clarity and brevity. 2/2

1 year ago 3 0 0 0

I've recently gotten back into the habit of checking QCSE for QEC posts. On average, I learn more from reading QCSE than from reading the arXiv. 1/2

1 year ago 3 0 1 0

Christopher pointed out that I didn't define fault-tolerant syndrome extraction. I've updated the question now.

1 year ago 0 0 0 0
Preview
fault-tolerant syndrome extraction on a 2D square grid Is there a known fault-tolerant method for measuring an arbitrary multi-qubit Pauli operator on a 2D square grid of qubits? I deliberately left out a space or time constraint. For simplicity, assum...

I'm asking this on QCSE: quantumcomputing.stackexchange.com/questions/40...

1 year ago 1 0 1 0
Advertisement

Is there a known fault-tolerant method for measuring an arbitrary multi-qubit Pauli operator on a 2D square grid of qubits?

I deliberately left out a space or time constraint. For simplicity, assume the Pauli operator acts on qubits located along one of the boundaries of the 2D square grid.

1 year ago 1 0 1 0
Post image

Submissions for QCTiP 2025 are now open.

1 year ago 23 15 1 2

Also useful for showing something doesn't work. Just need to run one counterexample instead of hunting for a mistake in a proof.

1 year ago 1 0 0 0

No delays, long live the arXiv 🙂

1 year ago 2 0 0 0

One reason I believe this could be useful is because I like defining codes by properties of circuits implementing them.

The advantage of a definition in terms of circuit properties is that it can answer: is this circuit implementing a color code/surface code/something else?

1 year ago 1 0 0 0

Been here 5 minutes and nobody posted a screenshot of their google scholar, so far, so good.

1 year ago 13 2 0 0

I write down the answer to flashcards

1 year ago 3 0 0 0


I answer flashcards in my head

1 year ago 6 0 1 0

Out of curiosity, a poll on memory systems. Like the post that applies to you.

1 year ago 2 0 1 0