Quantum 7, 959 (2023). https://doi.org/10.22331/q-2023-03-23-959 One of the challenges of quantum computers in the near- and mid- term is the limited number of qubits we can use for computations. Finding methods that achieve useful quantum […]
Tag: quantumjournal
Quantum 7, 958 (2023). https://doi.org/10.22331/q-2023-03-20-958 Field mediated entanglement experiments probe the quantum superposition of macroscopically distinct field configurations. We show that this phenomenon can be described by using a transparent quantum field theoretical formulation of […]
Quantum 7, 957 (2023). https://doi.org/10.22331/q-2023-03-20-957 Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. […]
Quantum 7, 956 (2023). https://doi.org/10.22331/q-2023-03-20-956 As a cornerstone for many quantum linear algebraic and quantum machine learning algorithms, controlled quantum state preparation (CQSP) aims to provide the transformation of $|irangle |0^nrangle to |irangle |psi_irangle $ […]
Quantum 7, 955 (2023). https://doi.org/10.22331/q-2023-03-20-955 The time-marching strategy, which propagates the solution from one time step to the next, is a natural strategy for solving time-dependent differential equations on classical computers, as well as for […]
Quantum 7, 954 (2023). https://doi.org/10.22331/q-2023-03-20-954 Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is […]
Quantum 7, 953 (2023). https://doi.org/10.22331/q-2023-03-17-953 Quantum contextual sets have been recognized as resources for universal quantum computation, quantum steering and quantum communication. Therefore, we focus on engineering the sets that support those resources and on […]
Quantum 7, 952 (2023). https://doi.org/10.22331/q-2023-03-17-952 We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. In […]
Quantum 7, 951 (2023). https://doi.org/10.22331/q-2023-03-17-951 Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been […]
Quantum 7, 950 (2023). https://doi.org/10.22331/q-2023-03-17-950 We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures. The method introduces a decomposition […]
Recent Comments