English
Related papers

Related papers: Quantum Catalytic Space

200 papers

Matching is a central problem in theoretical computer science, with a large body of work spanning the last five decades. However, understanding matching in the time-space bounded setting remains a longstanding open question, even in the…

Computational Complexity · Computer Science 2025-04-15 Aryan Agarwala , Ian Mertz

A catalytic machine is a model of computation where a traditional space-bounded machine is augmented with an additional, significantly larger, "catalytic" tape, which, while being available as a work tape, has the caveat of being…

Computational Complexity · Computer Science 2024-09-10 Marten Folkertsma , Ian Mertz , Florian Speelman , Quinten Tupker

The quantum computation of electronic energies can break the curse of dimensionality that plagues many-particle quantum mechanics. It is for this reason that a universal quantum computer has the potential to fundamentally change…

Catalytic computing concerns space bounded computation which starts with memory full of data that have to be restored by the end of the computation. Lossy catalytic computing, defined by Gupta et al. (2024) and fully characterized by…

Computational Complexity · Computer Science 2026-05-12 Michal Koucký , Ian Mertz , Sasha Sami

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource…

Quantum computing is the process of performing calculations using quantum mechanics. This field studies the quantum behavior of certain subatomic particles for subsequent use in performing calculations, as well as for large-scale…

Quantum Physics · Physics 2023-12-07 David Peral García , Juan Cruz-Benito , Francisco José García-Peñalvo

Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…

Quantum Physics · Physics 2025-08-28 Zhenyu Du , Zi-Wen Liu , Xiongfeng Ma

In a seminal work, Buhrman et al. (STOC 2014) defined the class $CSPACE(s,c)$ of problems solvable in space $s$ with an additional catalytic tape of size $c$, which is a tape whose initial content must be restored at the end of the…

Computational Complexity · Computer Science 2025-04-25 Yaroslav Alekseev , Yuval Filmus , Ian Mertz , Alexander Smal , Antoine Vinciguerra

One of the most promising suggested applications of quantum computing is solving classically intractable chemistry problems. This may help to answer unresolved questions about phenomena like: high temperature superconductivity, solid-state…

Quantum Physics · Physics 2020-04-08 Sam McArdle , Suguru Endo , Alan Aspuru-Guzik , Simon Benjamin , Xiao Yuan

Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers…

Quantum Physics · Physics 2026-02-05 Laurin E. Fischer

Quantum coherence, the ability to control the phases in superposition states is a resource, and it is of crucial importance, therefore, to understand how it is consumed in use. It has been suggested that catalytic coherence is possible,…

Quantum Physics · Physics 2018-09-26 Joan A. Vaccaro , Sarah Croke , Stephen M. Barnett

Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely…

High Energy Physics - Theory · Physics 2022-03-02 Shira Chapman , Giuseppe Policastro

Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. In this review we study the…

Quantum Physics · Physics 2015-05-13 Harry Buhrman , Richard Cleve , Serge Massar , Ronald de Wolf

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…

Quantum Physics · Physics 2008-11-26 Dave Bacon

Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…

Systems and Control · Electrical Eng. & Systems 2025-12-23 Julian Berberich , Robert L. Kosut , Thomas Schulte-Herbrüggen

The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…

Quantum Physics · Physics 2007-05-23 Lance Fortnow

Quantum thermodynamics is a research field that aims at fleshing out the ultimate limits of thermodynamic processes in the deep quantum regime. A complete picture of quantum thermodynamics allows for catalysts, i.e., systems facilitating…

Quantum Physics · Physics 2015-09-02 Nelly Huei Ying Ng , Laura Mančinska , Cristina Cirstoiu , Jens Eisert , Stephanie Wehner

Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…

Quantum Physics · Physics 2024-11-01 Aleksey K. Fedorov , Evgeniy O. Kiktenko , Nikolay N. Kolachevsky

This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No…

A catalytic machine is a space-bounded Turing machine with additional access to a second, much larger work tape, with the caveat that this tape is full, and its contents must be preserved by the computation. Catalytic machines were defined…

Computational Complexity · Computer Science 2025-04-14 Michal Koucký , Ian Mertz , Edward Pyne , Sasha Sami
‹ Prev 1 2 3 10 Next ›