Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Banks as Qubits: Quantum Circuit Dynamics in a Warped Economic Standard Model

Antonino Claudio Bonan

Published Aug 13, 2026• 0 citations
Publisher

Abstract

We reformulate banks in the warped Economic Standard Model as multi-qubit quantum registers whose interactions—money creation, interbank lending, securitisation,and equity injections—are quantum circuits. The gauge symmetries U(1), SU(2)L, and SU(3)c encode money, credit/debt, and functional roles into qubit states, whileKaluza–Klein modes of the U(1) field identify liquidity and equity as the massless and first massive modes. Money creation is a circuit where ancillae authorised bythe central bank are swapped into the monetary register, producing one liquidity and one equity quantum per transaction. Interbank lending and related operations areteleportation protocols acting on liquidity, credit/debt, or equity qubits, powered by pre-shared Bell-pair entanglement. The central bank’s supervisory function is a quantum instrument—a POVM whose weak-measurement regime stabilises banks via the Zeno effect, while loss of coherence triggers an anti-Zeno butterfly instability. Four axioms define the bank’s Hilbert space, aggregate colour-neutrality (with a three-level hierarchy), the money-creation circuit, and coherent monetary states. Fault-tolerant gate decompositions link operational resilience to quantum error correction, making confidence a threshold phenomenon. The framework provides a mathematically precise, testable language for quantum macro-prudential policy and central bank digital currency design.

DOI
10.5281/zenodo.21921146

Related papers

A Quantum Game Theory of the Banking System and the Economy: Circuits, Strategies, and Equilibria

Antonino Claudio Bonan

We present a formal quantum game theory of the banking system and the broader economy, founded on the qubit-circuit formulation of the warped Economic StandardModel developed before. Agents — commercial banks, non-bank firms, households, and the central bank — are modelled as multi-qubit quantum registers whose interac-tions are sequences of completely positive, trace-preserving (CPTP) maps and quantum instruments. Strategies are defined as CPTP channels encoding money creation(banks), trade and borrowing (non-bank agents), risk-taking, internal controls, and regulatory supervision. Payoffs are expectation values of economic observables, incorporating the information–disturbance trade-off of weak measurements, the resource cost of fault-tolerant internal controls (code distance), and the anti-Zeno (butterfly) decoherence that arises when agents lose coherence under repeated monitoring. A central feature is the circuit representation of trade as teleportation of liquidity, enabling non-bank agents to participate in the economy without money creation power. The anti-Zeno threshold provides a sharp bifurcation between stable and unstable regimes, leading to a taxonomy of eight pure-strategy, stationary equilibrium regimes — Zeno-stabilised, fragile anti-Zeno, projective intervention, disciplined separating, moral-hazard-driven, credit-crunch, inflationary, and colour-neutral diversified — that emerge from non-cooperative game theory under varying commitment, information, and policy configurations. We derive the conditions for each equilibrium and discuss policy implications for the central bank as a provider of magic-state ancillae and as a supervisory quantum instrument, offering a rigorous, testable language for quantum macro-prudential policy and central bank digital currency design.

•Aug 13, 2026•0 citations

Open Quantum Banking: Resource Theory and Dissipative Phase Transitions

Antonino Claudio Bonan

We present an open quantum system formulation of the banking sector in which the dynamics are driven by a sequence of quantum instruments interspersed with continuous unitary evolution. The banking system interacts with a structured environment representing global markets, real‑economy sectors, and natural resources, modelled as finite‑dimensional qudits. Every primitive economic operation is a quantum instrument. For quadratic Hamiltonians, the moment hierarchy closes at second order, leading to a coupled system of equations for the mean values and the covariance matrix of Pauli operators. Near a symmetric equilibrium, the covariance dynamics reduce to a Lyapunov equation whose normal modes describe localised domestic and delocalised global financial cycles. We construct a resource theory of systemic entanglement (SER) based on the negativity, interpreted as a macro‑prudential indicator of exploitable quantum correlations. The central bank’s ancilla injection is identified as the unique non‑LOCC operation that can replenish this resource. We elucidate the economic meaning of LOCC, of high‑quality Bell pairs as perfect financial channels, and of bound entanglement, showing that a zero SER faithfully signals the absence of usable quantum advantage. By decomposing environmental qudits into qubits, pairwise PPT tests become sufficient, guaranteeing that the SER captures all distillable entanglement. We prove that the damping matrix enforces asymptotic stability of the covariance dynamics, so that only two genuine macroscopic phases exist: a correlated trading phase with positive SER, and a Zeno‑localised phase with vanishing SER; a crisis can only occur on the critical surface separating them. The shape of the critical line in the phase diagram is shown to depend on the ancilla–environment correlation matrix, which encodes the central bank’s injection policy. A simple taxonomy of policies and corresponding critical line topologies is derived. The central bank acts as an environment engineer by injecting ancillae and extracting entropy via weak measurements. The framework offers a rigorous, resource‑theoretic foundation for macro‑prudential policy, capital adequacy, and central bank digital currencies.

•Sep 3, 2026•0 citations

Models of fault-tolerant quantum computation

Christopher M. Dawson

This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.

•Jan 1, 2006•0 citations

Quantum circuits and parallelism

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.

CRC Press eBooks•Nov 6, 2026•0 citations

Quantum-Secure Financial Settlement Systems: Zero-Knowledge Validation and Post-Quantum Ledger Interlocks

Yoko Hasebe

Global wholesale financial settlements, central bank digital currencies (CBDCs), and interbank clearing systems (e.g., SWIFT, Fedwire, TARGET2) rely almost exclusively on classical public-key cryptography—predominantly RSA-2048 and ECDSA. The advent of fault-tolerant quantum computing running Shor's factoring and discrete-logarithm algorithms introduces an existential vulnerability: hostile actors harvesting encrypted ledger traffic under "Store Now, Decrypt Later" (SNDL) doctrines can retroactively forge historical balance proofs, forge settlement authorizations, and drain national foreign exchange reserves. Furthermore, existing post-quantum algorithmic patches (such as pure software PQC) do not protect against internal ledger manipulation, transaction censorship, or side-channel key extraction. This monograph establishes the formal mathematical architecture and hardware implementation blueprint for a **Quantum-Secure Financial Settlement System (QFS)** designed to defend sovereign economic fabrics against systemic post-quantum shocks: (1) We integrate high-speed Physical Quantum Random Number Generators (QRNGs) based on vacuum-state quantum fluctuations with balanced homodyne detection, injecting certified, irreproducible entropy at rates exceeding 10 Gbps; (2) We construct a Post-Quantum Zero-Knowledge Virtual Machine (**zkVM**) utilizing recursive STARK proofs over the 64-bit Goldilocks field (F_p, p = 2^64 - 2^32 + 1), validating transaction validity, solvency, and compliance in zero-knowledge without leaking settlement counterparties, transaction amounts, or corporate account structures; (3) We formulate a dual-layer consensus interlock combining lattice-based digital signatures (ML-DSA-87 and Falcon-1024) with hardware-level PHOENIX_ROUTER physical interconnects, ensuring that cross-border clearing messages cannot be intercepted or modified; and (4) We establish autonomous circuit breakers enforcing sub-microsecond settlement freezes upon detecting non-quantum entropy anomalies. We demonstrate that this architecture satisfies regulatory capital standards under the Basel III/IV accords while fulfilling board fiduciary oversight duties under Delaware General Corporation Law.

•Oct 13, 2026•0 citations

Toward Scalable Quantum Computing with Superconducting Circuits

Michael Kerschbaum

Quantum computing holds the promise of solving problems that are intractable for classical computers, with applications ranging from optimization and materials simulation to cryptography. It achieves this by leveraging the exponentially scaling dimensionality of the space encoding quantum information and by executing algorithms on quantum registers in superposition states – a feature often referred to as quantum parallelism. However, while encoding information in computational units capable of exploring a continuous set of quantum states enables exponential scaling of computational power with system size, quantum systems are also more susceptible to errors than their classical counterparts. These errors take the form of both control errors, where miscalibration of the control pulses causes coherent errors on the qubit states, as well as incoherent errors due to energy relaxation and dephasing. Scaling quantum systems to run useful algorithms involving hundreds or thousands of logical qubits will require quantum error correction. In this approach, quantum information is redundantly encoded across an entangled state of many physical qubits. This has enabled experimental demonstrations across various platforms – including ion traps, superconducting circuits, and neutral atoms – showing that encoded quantum states can be preserved beyond the coherence times of the constituting physical qubits. However, quantum state preservation is only one component needed for scalable quantum computing. To execute algorithms, it is also necessary to implement quantum gates on and between encoded qubits, in a way that maintains fault tolerance by preserving the ability to correct errors as they occur during the computation. In the first part of this thesis, we demonstrate the implementation of an error-corrected quantum operation that entangles two logical qubits. This is achieved by performing lattice surgery on a distance-three surface code qubit, resulting in a logical Bell state encoded in distance-three repetition codes, which enable the correction of single bit-flip errors. We further introduce techniques to benchmark and characterize the performance of logical operations, including applying the protocol to arbitrary logical input states and performing logical quantum process tomography. Together, these results constitute one of the first realizations of error-corrected lattice surgery in superconducting circuits. While quantum error correction can correct errors provided they occur with sufficiently low frequency, it may fail when many qubits experience errors simultaneously. In the second part of this thesis, we therefore shift focus to a specific error mechanism known to cause correlated errors in superconducting circuits – quasiparticle-induced decoherence. In this case, various forms of energy deposition on the quantum device can break Cooper pairs into quasiparticles, which may subsequently diffuse to the tunnel junction and interact with the qubit state, thereby causing decoherence. In this thesis, we investigate the impact of quasiparticle tunneling on qubit performance, with a focus on infrared-induced quasiparticles. We compare the sensitivity of niobium-based qubits to those made from tantalum – a material that has gained interest in recent years following demonstrations of qubits with improved coherence times based on this material. Using a thermal radiator source, we show that the performance of tantalum qubits may be limited by infrared-induced quasiparticles in typical superconducting circuit experimental setups. By employing both ambient and in-line infrared filters, we investigate the effectiveness of different filtering strategies and develop best practices for engineering cryogenic environments for superconducting quantum processors. The results presented in this thesis contribute to the advancement of quantum computing based on superconducting circuits by implementing and characterizing quantum error-corrected operations, and by investigating quasiparticles as a source of decoherence, along with strategies to improve infrared filtering and signal conditioning in cryogenic environments for future fault-tolerant quantum computing.

•Jan 1, 2026•0 citations
We reformulate banks in the warped Economic Standard Model as multi-qubit quantum registers whose interactions—money creation, interbank lending, securitisation,and equity injections—are quantum circuits. The gauge symmetries U(1), SU(2)L, and SU(3)c encode money, credit/debt, and functional roles into qubit states, whileKaluza–Klein modes of the U(1) field identify liquidity and equity as the massless and first massive modes. Money creation is a circuit where ancillae authorised bythe central bank are swapped into the monetary register, producing one liquidity and one equity quantum per transaction. Interbank lending and related operations areteleportation protocols acting on liquidity, credit/debt, or equity qubits, powered by pre-shared Bell-pair entanglement. The central bank’s supervisory function is a quantum instrument—a POVM whose weak-measurement regime stabilises banks via the Zeno effect, while loss of coherence triggers an anti-Zeno butterfly instability. Four axioms define the bank’s Hilbert space, aggregate colour-neutrality (with a three-level hierarchy), the money-creation circuit, and coherent monetary states. Fault-tolerant gate decompositions link operational resilience to quantum error correction, making confidence a threshold phenomenon. The framework provides a mathematically precise, testable language for quantum macro-prudential policy and central bank digital currency design.
We present a formal quantum game theory of the banking system and the broader economy, founded on the qubit-circuit formulation of the warped Economic StandardModel developed before. Agents — commercial banks, non-bank firms, households, and the central bank — are modelled as multi-qubit quantum registers whose interac-tions are sequences of completely positive, trace-preserving (CPTP) maps and quantum instruments. Strategies are defined as CPTP channels encoding money creation(banks), trade and borrowing (non-bank agents), risk-taking, internal controls, and regulatory supervision. Payoffs are expectation values of economic observables, incorporating the information–disturbance trade-off of weak measurements, the resource cost of fault-tolerant internal controls (code distance), and the anti-Zeno (butterfly) decoherence that arises when agents lose coherence under repeated monitoring. A central feature is the circuit representation of trade as teleportation of liquidity, enabling non-bank agents to participate in the economy without money creation power. The anti-Zeno threshold provides a sharp bifurcation between stable and unstable regimes, leading to a taxonomy of eight pure-strategy, stationary equilibrium regimes — Zeno-stabilised, fragile anti-Zeno, projective intervention, disciplined separating, moral-hazard-driven, credit-crunch, inflationary, and colour-neutral diversified — that emerge from non-cooperative game theory under varying commitment, information, and policy configurations. We derive the conditions for each equilibrium and discuss policy implications for the central bank as a provider of magic-state ancillae and as a supervisory quantum instrument, offering a rigorous, testable language for quantum macro-prudential policy and central bank digital currency design.
We present an open quantum system formulation of the banking sector in which the dynamics are driven by a sequence of quantum instruments interspersed with continuous unitary evolution. The banking system interacts with a structured environment representing global markets, real‑economy sectors, and natural resources, modelled as finite‑dimensional qudits. Every primitive economic operation is a quantum instrument. For quadratic Hamiltonians, the moment hierarchy closes at second order, leading to a coupled system of equations for the mean values and the covariance matrix of Pauli operators. Near a symmetric equilibrium, the covariance dynamics reduce to a Lyapunov equation whose normal modes describe localised domestic and delocalised global financial cycles. We construct a resource theory of systemic entanglement (SER) based on the negativity, interpreted as a macro‑prudential indicator of exploitable quantum correlations. The central bank’s ancilla injection is identified as the unique non‑LOCC operation that can replenish this resource. We elucidate the economic meaning of LOCC, of high‑quality Bell pairs as perfect financial channels, and of bound entanglement, showing that a zero SER faithfully signals the absence of usable quantum advantage. By decomposing environmental qudits into qubits, pairwise PPT tests become sufficient, guaranteeing that the SER captures all distillable entanglement. We prove that the damping matrix enforces asymptotic stability of the covariance dynamics, so that only two genuine macroscopic phases exist: a correlated trading phase with positive SER, and a Zeno‑localised phase with vanishing SER; a crisis can only occur on the critical surface separating them. The shape of the critical line in the phase diagram is shown to depend on the ancilla–environment correlation matrix, which encodes the central bank’s injection policy. A simple taxonomy of policies and corresponding critical line topologies is derived. The central bank acts as an environment engineer by injecting ancillae and extracting entropy via weak measurements. The framework offers a rigorous, resource‑theoretic foundation for macro‑prudential policy, capital adequacy, and central bank digital currencies.
This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.
This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.
Global wholesale financial settlements, central bank digital currencies (CBDCs), and interbank clearing systems (e.g., SWIFT, Fedwire, TARGET2) rely almost exclusively on classical public-key cryptography—predominantly RSA-2048 and ECDSA. The advent of fault-tolerant quantum computing running Shor's factoring and discrete-logarithm algorithms introduces an existential vulnerability: hostile actors harvesting encrypted ledger traffic under "Store Now, Decrypt Later" (SNDL) doctrines can retroactively forge historical balance proofs, forge settlement authorizations, and drain national foreign exchange reserves. Furthermore, existing post-quantum algorithmic patches (such as pure software PQC) do not protect against internal ledger manipulation, transaction censorship, or side-channel key extraction. This monograph establishes the formal mathematical architecture and hardware implementation blueprint for a **Quantum-Secure Financial Settlement System (QFS)** designed to defend sovereign economic fabrics against systemic post-quantum shocks: (1) We integrate high-speed Physical Quantum Random Number Generators (QRNGs) based on vacuum-state quantum fluctuations with balanced homodyne detection, injecting certified, irreproducible entropy at rates exceeding 10 Gbps; (2) We construct a Post-Quantum Zero-Knowledge Virtual Machine (**zkVM**) utilizing recursive STARK proofs over the 64-bit Goldilocks field (F_p, p = 2^64 - 2^32 + 1), validating transaction validity, solvency, and compliance in zero-knowledge without leaking settlement counterparties, transaction amounts, or corporate account structures; (3) We formulate a dual-layer consensus interlock combining lattice-based digital signatures (ML-DSA-87 and Falcon-1024) with hardware-level PHOENIX_ROUTER physical interconnects, ensuring that cross-border clearing messages cannot be intercepted or modified; and (4) We establish autonomous circuit breakers enforcing sub-microsecond settlement freezes upon detecting non-quantum entropy anomalies. We demonstrate that this architecture satisfies regulatory capital standards under the Basel III/IV accords while fulfilling board fiduciary oversight duties under Delaware General Corporation Law.
Quantum computing holds the promise of solving problems that are intractable for classical computers, with applications ranging from optimization and materials simulation to cryptography. It achieves this by leveraging the exponentially scaling dimensionality of the space encoding quantum information and by executing algorithms on quantum registers in superposition states – a feature often referred to as quantum parallelism. However, while encoding information in computational units capable of exploring a continuous set of quantum states enables exponential scaling of computational power with system size, quantum systems are also more susceptible to errors than their classical counterparts. These errors take the form of both control errors, where miscalibration of the control pulses causes coherent errors on the qubit states, as well as incoherent errors due to energy relaxation and dephasing. Scaling quantum systems to run useful algorithms involving hundreds or thousands of logical qubits will require quantum error correction. In this approach, quantum information is redundantly encoded across an entangled state of many physical qubits. This has enabled experimental demonstrations across various platforms – including ion traps, superconducting circuits, and neutral atoms – showing that encoded quantum states can be preserved beyond the coherence times of the constituting physical qubits. However, quantum state preservation is only one component needed for scalable quantum computing. To execute algorithms, it is also necessary to implement quantum gates on and between encoded qubits, in a way that maintains fault tolerance by preserving the ability to correct errors as they occur during the computation. In the first part of this thesis, we demonstrate the implementation of an error-corrected quantum operation that entangles two logical qubits. This is achieved by performing lattice surgery on a distance-three surface code qubit, resulting in a logical Bell state encoded in distance-three repetition codes, which enable the correction of single bit-flip errors. We further introduce techniques to benchmark and characterize the performance of logical operations, including applying the protocol to arbitrary logical input states and performing logical quantum process tomography. Together, these results constitute one of the first realizations of error-corrected lattice surgery in superconducting circuits. While quantum error correction can correct errors provided they occur with sufficiently low frequency, it may fail when many qubits experience errors simultaneously. In the second part of this thesis, we therefore shift focus to a specific error mechanism known to cause correlated errors in superconducting circuits – quasiparticle-induced decoherence. In this case, various forms of energy deposition on the quantum device can break Cooper pairs into quasiparticles, which may subsequently diffuse to the tunnel junction and interact with the qubit state, thereby causing decoherence. In this thesis, we investigate the impact of quasiparticle tunneling on qubit performance, with a focus on infrared-induced quasiparticles. We compare the sensitivity of niobium-based qubits to those made from tantalum – a material that has gained interest in recent years following demonstrations of qubits with improved coherence times based on this material. Using a thermal radiator source, we show that the performance of tantalum qubits may be limited by infrared-induced quasiparticles in typical superconducting circuit experimental setups. By employing both ambient and in-line infrared filters, we investigate the effectiveness of different filtering strategies and develop best practices for engineering cryogenic environments for superconducting quantum processors. The results presented in this thesis contribute to the advancement of quantum computing based on superconducting circuits by implementing and characterizing quantum error-corrected operations, and by investigating quasiparticles as a source of decoherence, along with strategies to improve infrared filtering and signal conditioning in cryogenic environments for future fault-tolerant quantum computing.