119 citations · 257 across the 11 of their papers we have counts for
11 papers
Circuit-Level Loss Performance of RHG and Foliated Floquet Color Codes in a Compound Photon--Atom Quantum Architecture
Dana Ben Porath, Juval Bechar, Daniel Azses +1
A central question for fault-tolerant quantum computing is which quantum error-correcting codes are best suited to a given hardware architecture. Here we compare the Raussendorf--H…
Blueprint for a fault-tolerant compound photon-atom quantum architecture
Geva Arwas, Doron Azoury, Daniel Azses +11
Fault-tolerant quantum computing requires architectures that simultaneously address scalability, connectivity, and error correction under realistic noise constraints. We present a…
Nonunitary gates using measurements only
Daniel Azses, Jonathan Ruhman, Eran Sela
Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By defo…
Redundant string symmetry-based error correction: Demonstrations on quantum devices
Zhangjie Qin, Daniel Azses, Eran Sela +2
Computational power in measurement-based quantum computing stems from the symmetry-protected topological (SPT) order of entangled resource states. However, resource states are pron…
Multipartite entanglement and quantum error identification in -dimensional cluster states
Sowrabh Sudevan, Daniel Azses, Emanuele G. Dalla Torre +2
An entangled state is said to be -uniform if the reduced density matrix of any qubits is maximally mixed. This is intimately linked to pure quantum error correction codes (Q…
Symmetry-resolved entanglement of 2D symmetry-protected topological states
Daniel Azses, David F. Mross, Eran Sela
Symmetry-resolved entanglement is a useful tool for characterizing symmetry-protected topological states. In two dimensions, their entanglement spectra are described by conformal f…
Navigating the noise-depth tradeoff in adiabatic quantum circuits
Daniel Azses, Maxime Dupont, Bram Evert +2
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves mo…
Observing Floquet topological order by symmetry resolution
Daniel Azses, Emanuele G. Dalla Torre, Eran Sela
Symmetry protected topological order in one dimension leads to protected degeneracies between symmetry blocks of the reduced density matrix. In the presence of periodic driving, to…
Playing quantum nonlocal games with six noisy qubits on the cloud
Meron Sheffer, Daniel Azses, Emanuele G. Dalla Torre
Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage. These games are well suited for noisy quantum computers because they only require the…
Symmetry-resolved entanglement in symmetry-protected topological phases
Daniel Azses, Eran Sela
Symmetry protected topological phases (SPTs) have universal degeneracies in the entanglement spectrum in one dimension (1D). Here, we formulate this phenomenon in the framework of…
Identification of symmetry-protected topological states on noisy quantum computers
Daniel Azses, Rafael Haenel, Yehuda Naveh +3
Identifying topological properties is a major challenge because, by definition, topological states do not have a local order parameter. While a generic solution to this challenge i…