Zobrazeno 1 - 10
of 121
pro vyhledávání: '"Feld, Sebastian"'
A longstanding computational challenge is the accurate simulation of many-body particle systems. Especially for deriving key characteristics of high-impact but complex systems such as battery materials and high entropy alloys (HEA). While simple mode
Externí odkaz:
http://arxiv.org/abs/2411.15667
Autor:
Wulff, Arne, Venkata, Swapan Madabhushi, Chen, Boyang, Feld, Sebastian, Möller, Matthias, Tang, Yinglu
We, the QAIMS lab lab at the Aerospace Faculty of TU Delft, participated as finalists in the Airbus/BMW Quantum Computing Challenge 2024. Stacking sequence retrieval, a complex combinatorial task within a bi-level optimization framework, is crucial f
Externí odkaz:
http://arxiv.org/abs/2411.10303
Autor:
Nüßlein, Jonas, Sünkel, Leo, Stein, Jonas, Rohe, Tobias, Schuman, Daniëlle, Linnhoff-Popien, Claudia, Feld, Sebastian
QAOA is a quantum algorithm for solving combinatorial optimization problems. It is capable of searching for the minimizing solution vector $x$ of a QUBO problem $x^TQx$. The number of two-qubit CNOT gates in the QAOA circuit scales linearly in the nu
Externí odkaz:
http://arxiv.org/abs/2411.08824
This research investigates the possibility of using quantum optimal control techniques to co-optimize the energetic cost and the process fidelity of a quantum unitary gate. The energetic cost is theoretically defined, and thereby, the gradient of the
Externí odkaz:
http://arxiv.org/abs/2411.06556
Autor:
Fan, Junyu, Steinberg, Matthew, Jahn, Alexander, Cao, Chunjun, Sarkar, Aritra, Feld, Sebastian
Quantum error correction (QEC) is a crucial prerequisite for future large-scale quantum computation. Finding and analyzing new QEC codes, along with efficient decoding and fault-tolerance protocols, is central to this effort. Holographic codes are a
Externí odkaz:
http://arxiv.org/abs/2410.22861
Autor:
Zielinski, Sebastian, Nüßlein, Jonas, Kölle, Michael, Gabor, Thomas, Linnhoff-Popien, Claudia, Feld, Sebastian
As contemporary quantum computers do not possess error correction, any calculation performed by these devices can be considered an involuntary approximation. To solve a problem on a quantum annealer, it has to be expressed as an instance of Quadratic
Externí odkaz:
http://arxiv.org/abs/2409.15891
Several recent techniques for modifying topological codes with single-qubit Clifford operators have shown high resilience against pure Pauli noise. Paramount to these findings has been the demonstration that several variants exhibit error thresholds
Externí odkaz:
http://arxiv.org/abs/2408.06232
Autor:
Paraskevopoulos, Nikiforos, Hamel, David, Sarkar, Aritra, Almudever, Carmen G., Feld, Sebastian
In the fast-paced field of quantum computing, identifying the architectural characteristics that will enable quantum processors to achieve high performance across a diverse range of quantum algorithms continues to pose a significant challenge. Given
Externí odkaz:
http://arxiv.org/abs/2407.18151
Autor:
Bandic, Medina, Henaff, Pablo le, Ovide, Anabel, Escofet, Pau, Rached, Sahar Ben, Rodrigo, Santiago, van Someren, Hans, Abadal, Sergi, Alarcon, Eduard, Almudever, Carmen G., Feld, Sebastian
Application-specific quantum computers offer the most efficient means to tackle problems intractable by classical computers. Realizing these architectures necessitates a deep understanding of quantum circuit properties and their relationship to execu
Externí odkaz:
http://arxiv.org/abs/2407.12640
Autor:
Steinberg, Matthew, Fan, Junyu, Harris, Robert J., Elkouss, David, Feld, Sebastian, Jahn, Alexander
We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadama
Externí odkaz:
http://arxiv.org/abs/2407.11926