Quantum 8, 1380 (2024). https://doi.org/10.22331/q-2024-06-18-1380 Committing to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not […]
Quantum 8, 1380 (2024). https://doi.org/10.22331/q-2024-06-18-1380 Committing to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not […]
Quantum 8, 1379 (2024). https://doi.org/10.22331/q-2024-06-18-1379 There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the […]
Quantum 8, 1378 (2024). https://doi.org/10.22331/q-2024-06-18-1378 We present a free open source package for high performance simulation and numerical investigation of boson samplers and, more generally, multi-photon interferometry. Our package is written in Julia, allowing C-like […]
Quantum 8, 1377 (2024). https://doi.org/10.22331/q-2024-06-17-1377 It is a long-standing open question in quantum complexity theory whether the definition of $non-deterministic$ quantum computation requires quantum witnesses (QMA) or if classical witnesses suffice (QCMA). We make progress […]
Quantum 8, 1376 (2024). https://doi.org/10.22331/q-2024-06-17-1376 We investigate what quantum advantages can be obtained in multipartite non-cooperative games by studying how different types of quantum resources can lead to new Nash equilibria and improve social welfare […]
Quantum 8, 1375 (2024). https://doi.org/10.22331/q-2024-06-17-1375 Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum algorithms feature many qubits that […]
Quantum 8, 1374 (2024). https://doi.org/10.22331/q-2024-06-17-1374 A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational […]
Quantum 8, 1373 (2024). https://doi.org/10.22331/q-2024-06-17-1373 We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state […]
Quantum 8, 1372 (2024). https://doi.org/10.22331/q-2024-06-13-1372 We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in […]
Quantum 8, 1371 (2024). https://doi.org/10.22331/q-2024-06-13-1371 We propose the regularized compressed double factorization (RC-DF) method to classically compute compressed representations of molecular Hamiltonians that enable efficient simulation with noisy intermediate scale (NISQ) and error corrected quantum […]
Recent Comments