Papers

Quantum algorithms based on parameterized quantum circuits (PQCs) have enabled a wide range of applications on near-term quantum devices. However, existing PQC architectures face several challenges, among which the “barren plateaus" phenomenon is particularly prominent. In such cases, the loss function concentrates exponentially with increasing system size, thereby hindering effective parameter optimization. To address this challenge, we propose a general and hardware-efficient method for eliminating barren plateaus in an arbitrary PQC. Specifically, our approach achieves this by inserting a layer of easily implementable quantum channels into the original PQC, each channel requiring only one ancilla qubit and four additional gates, yielding a modified PQC (MPQC) that is provably at least as expressive as the original PQC and, under mild assumptions, is guaranteed to be free from barren plateaus. Furthermore, by appropriately adjusting the structure of MPQCs, we rigorously prove that any parameter in the original PQC can be made trainable. Importantly, the absence of barren plateaus in MPQCs is robust against realistic noise, making our approach directly applicable to near-term quantum hardware. Numerical simulations demonstrate that MPQC effectively eliminates barren plateaus in PQCs for preparing thermal states of systems with up to 100 qubits and 2400 layers. Furthermore, in end-to-end simulations, MPQC significantly outperforms PQC in finding the ground-state energy of a complex Hamiltonian.

We investigate the Lieb–Liniger model of interacting one-dimensional bosons coupled to a localized impurity, modeled by a delta barrier. While the Lieb–Liniger gas is integrable, the impurity breaks integrability and induces a transition towards quantum chaos. We show that the low-energy spectrum exhibits random-matrix statistics, in striking contrast to the Bohigas–Giannoni–Schmit conjecture, where chaotic behavior typically emerges at high energy. For two bosons, the odd-parity sector remains integrable, whereas the even-parity sector displays clear signatures of chaos at low energy and a crossover back to quasi-integrable behavior at higher energies. For three bosons, both parity sectors exhibit spectral statistics close to chaos at low energy. We argue that this unconventional form of few-body quantum chaos originates from diffractive processes induced by the impurity.

The fidelity estimation between two quantum states is crucial for quantum computation and information science. However, an efficacious method for this, especially for mixed states and higher-dimensional density matrices, remains elusive. While there are many existing algorithms on computing the fidelity between two pure states, there is not much work on how to obtain the fidelity between two mixed states. Here, an efficient quantum algorithm for the fidelity estimation is proposed, based primarily on the density matrix exponentiation and interferometeric scheme for mixed states, with a time complexity of $O(\kappa^2N^2/\epsilon^7)$, where $N$ is the system size, $\kappa$ is the larger of the condition number of the density matrices and $\epsilon$ is a precision error. This algorithm may serve as a resource-efficient technique to deduce fidelity of any two (pure or mixed) unknown or known quantum states, when the density matrices of the quantum states commute with each other.

The tin-vacancy center in diamond (SnV) has emerged as a compelling building block for realizing next-generation quantum networks thanks to its excellent optical and spin properties. Coupling to photonic crystal cavities (PCCs) promises to further enhance the SnV light-matter interface and unlock a diverse range of entanglement generation protocols. Recent pioneering experiments showing Purcell enhancement of SnV centers in PCCs underscore this potential. However, optical coupling that is coherent - the key ingredient for use in quantum protocols - has so far remained elusive. Here, we demonstrate above-unity coherent cooperativity of SnV centers embedded in photonic crystal cavities. We fabricate free-standing PCCs using a quasi-isotropic undercut. Across two samples, we conduct room-temperature characterizations, measuring resonances for 327 cavities, with an average quality factor exceeding $Q = 1.0(3) \times 10^4$. Two cavity-coupled emitters are examined in detail, exhibiting quality factors up to $Q = 25.4(4) \times 10^3$ and Purcell-reduced lifetimes corresponding to cooperativities up to $C = 20.6(11)$. Furthermore, the single SnVs are observed to strongly modulate the cavity transmission with an extinction contrast up to $98.8(4) \%$ on resonance. Finally, SnV linewidth measurements reveal above-unity coherent cooperativities in both devices, with the highest value being $C_\mathrm{coh} = 8.3(12)$. These results open the door to using cavity-coupled SnV centers as efficient, coherent light-matter interfaces for future quantum networks.

The traditional Standard Quantum Mechanics (SQM) theory is unable to solve the Spin-s problem, i.e., to justify the utterly important "Pauli Exclusion Principle". A complete and straightforward solution of the Spin-Statistics problem is presented based on the "Weyl Integrable Quantum Mechanics" (WIQM) theory. This theory provides a Weyl-gauge invariant formulation of the Standard Quantum Mechanics and reproduces successfully, with no restrictions, the full set of the quantum mechanical processes, including the formulation of Dirac's or Schrödinger's equation, of Heisenberg's uncertainty relations, and of the nonlocal EPR correlations. etc. When the Weyl Integrable Quantum Mechanics is applied to a system made of many identical particles with spin, an additional constant property of all elementary particles enters naturally into play: the "intrinsic helicity", or the "intrinsic angular - momentum". This additional particle property, not considered by Standard Quantum Mechanics, determines the correct Spin-Statistics Connection (SSC) observed in Nature. All this leads to the consideration of a novel, most complete (in the EPR sense) quantum mechanical theory.

We study exact quantum recurrences in the double kicked top (DKT), a driven spin model that extends the quantum kicked top (QKT) by introducing an additional time-reversal symmetry-breaking kick. Reformulating its dynamics in terms of effective parameters $k_r$ and $k_\theta$, we analytically show exact periodicity of the Floquet operator for $k_r = j\pi/2$ and $k_r = j\pi/4$ with distinct periods for integer and half-odd integer $j$. These exact recurrences were found to be independent of $k_\theta$. The long-time-averaged entanglement and fidelity rate function show dynamical quantum phase transition (DQPT) for $k_r = j\pi/2$ at time-reversal symmetric cases $k_\theta = \pm k_r$. In the other time-reversal symmetric case $k_\theta = 0$, the DQPT exists only for a half-odd integer $j$. Using level statistics, a smooth transition is observed from integrable to non-integrable nature as $k_r$ is changed away from $j\pi/2$. Our work demonstrates that regular and chaotic regimes can be controlled for any system size by tuning $k_r$ and $k_\theta$, making the DKT a useful platform for quantum control and information processing applications.

Quantum computers (QCs) have the potential to solve critical problems significantly faster than today's most advanced supercomputers. One major challenge in realizing this technology is designing robust electrostatic pulses to realize unitaries on qubits. Current practice when calibrating unitaries involves recursive experimentation to find the highest-fidelity pulses. To accelerate this process for experimentalists, we implement Qalibrate, a fast, JAX-enabled simulator that generates pulses given target unitaries. Specifically, we generate a propagator that models the time evolution of three-electron spin qubits and integrate our gradient-based optimizer to generate the pulses. The simulation involves solving the Lindblad master equation, which we parallelize by employing an approximation of the time evolution called the Magnus expansion. Qalibrate shows up to a 34x speedup compared to an existing ODE simulator, making progress towards generating robust pulses for n-qubit systems.

We analytically investigate the switching rate in a two-photon driven Kerr oscillator with finite detuning and two-photon dissipation. This system exhibits quantum bistability and supports a logical manifold for a bosonic qubit. Using Kramer's theory together with the $P$-representation, we derive an analytical expression for the bit-flip error rate within the potential-barrier approximation. The agreement is demonstrated between analytical calculations and numerical simulations obtained by diagonalization of the Liouvillian superoperator. In the purely dissipative limit, the switching rate increases monotonically with detuning, as the two metastable states approach each other in phase space. However, the exponential contribution to the bit-flip rate exhibits a nontrivial dependence on system parameters, extending beyond the naive scaling with the average photon number. In the presence of large Kerr nonlinearity, the switching rate becomes a nonmonotonic function of the detuning and reaches a minimum at a finite detuning. This effect arises because detuning lowers the activation barrier for weak nonlinearity but increases it for large ones, ensuring a minimum of the switching-rate at nonzero detuning. These results establish key conditions for optimizing the performance of critical cat qubits and are directly relevant for the design of scalable superconducting bosonic quantum architectures.

Hardware-friendly quantum low-density parity-check (QLDPC) decoders are commonly built upon belief propagation (BP) processing. Yet, quantum degeneracy often prevents BP from achieving reliable convergence. To overcome this fundamental limitation, we propose the restart belief (RB) decoder, an iterative BP-based algorithm inspired by branch-and-bound optimization principles. From our analysis we find that the RB decoder represents both the fastest and most accurate decoding algorithm applicable to QLDPC codes to date, conceived with the explicit goal of approaching error correction up to the code distance.

Lattice spin models featuring kinetic constraints constitute a paradigmatic setting for the investigation of glassiness and localization phenomena. The intricate dynamical behavior of these systems is a result of the dramatically reduced connectivity between many-body configurations. This truncation of transition pathways often leads to a fragmentation of the Hilbert space, yielding highly collective and therefore often slow dynamics. Moreover, this mechanism supports the formation of characteristic elementary excitations, which we investigate here theoretically in a two-dimensional Rydberg lattice gas. We explore their properties as a function of interaction strength and range, and illustrate how they can be experimentally probed via sideband spectroscopy. Here, we show that the transition rate to certain delocalized superposition states of elementary excitations displays collective many-body enhancement.

The increasing depth of quantum circuits presents a major limitation for the execution of quantum algorithms, as the limited coherence time of physical qubits leads to noise that manifests as errors during computation. In this work, we focus on CNOT ladder circuits, which find applications in several quantum computing tasks, including the preparation of GHZ states, the implementation of fan-out and long-range CNOT gates, fermionic simulations, and the construction of ansatz circuits for variational quantum computing. The linearly increasing depth of a CNOT ladder circuit can be exchanged for constant CNOT depth at the expense of wider circuits that rely on mid-circuit measurements and classically controlled operations. Our error analysis shows that the choice between these two constructions depends on the relative difference between CNOT and idling error rates. Overall, the technique developed in this work enables low-depth implementations of circuits that are ubiquitous in quantum computing algorithms.

Quantum error mitigation (QEM) has been proposed as a class of hardware-friendly error suppression techniques. While QEM has been primarily studied for mitigating errors in the estimation of expectation values of observables, recent works have explored its application to estimating noiseless probability distributions. In this work, we propose two protocols to improve the accuracy of QEM for probability distributions, inspired by techniques in software engineering. The first is the N-version programming method, which compares probability distributions obtained via different QEM strategies and excludes the outlier distribution, certifying the feasibility of the error-mitigated distributions. The second is a consistency-based method for selecting an appropriate extrapolation strategy. Specifically, we prepare $K$ data points at different error rates, choose $L<K$ of them for extrapolation, and evaluate error-mitigated results for all $\binom{K}{L}$ possible choices. We then select the extrapolation method that yields the smallest variance in the error-mitigated results. This procedure can also be applied bitstring-wise, enabling adaptive error mitigation for each probability in the distribution.

Non-semisimple Ising anyons extend the fusion space of conventional Ising models and offer a new route toward universal topological quantum computation (TQC). However, how to construct a high-fidelity universal quantum gate set that meets fault-tolerant thresholds via braiding operations of non-semisimple Ising anyons remains unexplored. By employing a Genetic Algorithm-enhanced Solovay–Kitaev Algorithm (GA-enhanced SKA), we achieve high-fidelity approximations of standard single-qubit gates (Hadamard $H$-gate and phase $T$-gate) with a recursion level of just three, meeting the fidelity requirements for fault-tolerant quantum computation. Our numerical results demonstrate that for the critical parameter range $\alpha \in [2.001,\, 2.022]$, a few braiding operations can approximate the local equivalence class $[\mathrm{CNOT}]$ with high precision. In contrast to prior theoretical works that established the universality of non-semisimple Ising anyons, this work provides the first complete, executable, and parameter-optimized compilation scheme for high-fidelity universal gates. It quantifies the relationship between the key physical parameter $\alpha$ and gate fidelity, and it delivers direct numerical evidence for the universality of non-semisimple Ising anyons.

Color codes present distinct advantages for fault-tolerant quantum computing, such as high encoding rates and the transversal implementation of Clifford gates. However, existing matching-based decoders for the color codes such as the restricted decoder (Kubica and Delfosse, 2023), suffer from limited decoding performance. Inspired by the global decoding insight of the unified decoder (Benhemou et al., 2023), this paper introduces a correlated decoder for the 4.8.8 color code, which improves upon the conventional restricted decoder by leveraging correlations between restricted lattices, and is derived by mapping the correlated matching decoder for the surface code onto the color code lattice. Analytical and numerical results show that the correlated decoder achieves higher thresholds than the restricted and unified decoders, while matching the performance of the unified decoder at very low physical error rates. Under the code capacity and phenomenological noise models, the estimated thresholds for the color code against bit-flip error are 10.38% and 3.13%, respectively. Furthermore, by applying the surface-color code mapping, the thresholds of 16.62% and 3.52% are obtained for the surface code against depolarizing noise.

Quantum Mpemba effect describes an anomalous phenomenon of accelerated relaxation which is of fundamental interest in the field of nonequilibrium thermodynamics. Conventional theories on this phenomenon strongly rely on the Born-Markovian approximation resulting in a Lindblad-type master equation whose evolution is governed by a Liouvillian superoperator. It has been demonstrated that exceptional points of the Liouvillian superoperator can induce the Mpemba effect in Markovian regimes. Moving beyond this Markovian limit, we here propose a mechanism for realizing the quantum Mpemba effect in a general non-Markovian relaxation process by means of non-Markovian exceptional points. We verify the feasibility of this mechanism within a dissipative quantum harmonic oscillator model, which is exactly solvable and experimentally practical. Providing new insight into the interesting non-equilibrium dynamics, our work paves a way to accelerate the transfer of energy and information in quantum systems.

The fundamental division of the total quantum evolution phase into geometric and dynamical components is a central problem in quantum physics. Here, we prove a remarkably simple and universal law demonstrating that this partitioning is governed, at every instant, solely by a single geometric quantity: the Bargmann angle (Bures angle). This result provides a universally applicable and rigorous way to define the exact fraction of the total phase that is geometric versus dynamical in origin, thereby establishing a new quantitative link between the dynamics of quantum evolution and the geometry of the state space. This finding has immediate practical consequences, furnishing a real-time measure of the geometricity of an evolution for designing high-fidelity geometric quantum gates with optimized robustness, and opening new avenues for quantum speed limit and coherent control.

We investigate a non-Hermitian quantum battery based on the Su-Schrieffer-Heeger (SSH) lattice, charged through a parity-time (PT)-symmetric protocol that alternates gain and loss between the two sublattices. The interplay between lattice topology and non-Hermiticity gives rise to both bulk and edge exceptional points (EPs), which govern the charging dynamics. In the topological regime, an edge-state EP appears at a smaller gain-loss strength than the bulk thresholds and gives rise to an additional edge-broken regime absent in the trivial configuration. This topology-specific spectral structure is reflected in the charging dynamics, where the topological phase exhibits more favorable transient and long-time performance in the representative non-Hermitian regimes considered here. We further examine the corresponding Lindblad dynamics, identifying the non-Hermitian model as the conditional no-jump description of the same gain-loss processes. The Lindblad results show that the topological advantage remains visible at the level of stored energy, extractable work, and extractable fraction under unconditional open-system evolution. These findings demonstrate that topology constitutes a genuine physical resource for enhancing the performance of quantum batteries.

The discovery of topological phases has ushered in a new era of condensed matter physics and revealed a variety of natural and artificial materials. They obey the bulk-boundary correspondence (BBC), which guarantees the emergence of boundary states with nonzero topological invariants in the bulk. Widespread attention has been paid to extending topological phases to nonlinear and non-Hermitian systems. However, the BBC and topological invariants of non-Hermitian nonlinear systems remain largely unexplored. Here, we establish a complete BBC and topological characterization of the topological phases in a class of non-Hermitian nonlinear-eigenvalue systems by introducing an auxiliary system. We restore the BBC broken by non-Hermiticity via employing the generalized Brillouin zone on the auxiliary system. Remarkably, we discover that the interplay between non-Hermiticity and nonlinearity creates an exotic complex-band topological phase that coexists with the real-band topological phase. Our results enrich the family of nonlinear topological phases and lay a foundation for exploring novel topological physics in metamaterial systems.

This article presents a novel encoding for quantum Lattice Boltzmann method algorithm using Carleman linearization. In contrast to previous articles \cite{Sanavio2024LatticeBC,sanavio2025carleman}, the encoding used allows for local collision rules while keeping a higher probability to obtain the right result, which is of the order of $10^{-2}$. The algorithm scales as $O(log_2^2(N)+Q^3)$ each time step with $N$ the number of lattice sites of the 2D lattice and $Q$ the number of channels with a constant number of qubits when using dynamical circuits.

Open quantum systems exhibit dynamics ranging from unitary evolution to irreversible dissipation. While the Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) equation uniquely characterizes Markovian CPTP evolution, many physical platforms display non-Markovian features such as algebraic relaxation and coherence backflow. Fractional calculus provides a natural way to model such long-memory behavior through power-law temporal kernels introduced by fractional time derivatives. Here we develop a unified framework that embeds fractional master equations within the broader hierarchy of open-system formalisms. The fractional equation forms a structured subclass of memory-kernel models, reduces to the Lindblad form at unit order, and, through Bochner–Phillips subordination, admits a CPTP representation as an average over Lindblad semigroups. Its resolvent structure further connects fractional dynamics to established non-Markovian approaches, including Nakajima–Zwanzig kernels and hierarchical equations of motion, providing a compact surrogate for long-memory effects. This formulation positions fractional calculus as a rigorous and practical language for quantum dynamics with intrinsic memory, supporting both analytical insight and efficient quantum simulation.

Quantum computing is an emerging computational paradigm with the potential to outperform classical computers in solving a variety of problems. To achieve this, quantum programs are typically represented as quantum circuits, which must be optimized and adapted for target hardware through quantum circuit compilation. We introduce ZX-DB, a data-driven system that performs quantum circuit simplification and rewriting inside a graph database using ZX-calculus, a complete graphical formalism for quantum mechanics. ZX-DB encodes ZX-calculus rewrite rules as standard openCypher queries and executes them on an example graph database engine, Memgraph, enabling efficient, database-native transformations of large-scale quantum circuits. ZX-DB integrates correctness validation via tensor and graph equivalence checks and is evaluated against the state-of-the-art PyZX framework. Experimental results show that ZX-DB achieves up to an order-of-magnitude speedup for independent rewrites, while exposing pattern-matching bottlenecks in current graph database engines. By uniting quantum compilation and graph data management, ZX-DB opens a new systems direction toward scalable, database-supported quantum computing pipelines.

The time-dependent Schrödinger equation (TDSE) in real space is fundamental to understanding the dynamics of many-electron quantum systems, with applications ranging from quantum chemistry to condensed matter physics and materials science. However, solving the TDSE for complex fermionic systems remains a significant challenge, particularly due to the need to capture the time-evolving many-body correlations, while the antisymmetric nature of fermionic wavefunctions complicates the function space in which these solutions must be represented. We propose a general-purpose neural network framework for solving the real-space TDSE, Fermionic Antisymmetric Spatio-Temporal Network, which treats time as an explicit input alongside spatial coordinates, enabling a unified spatiotemporal representation of complex, antisymmetric wavefunctions for fermionic systems. This approach formulates the TDSE as a global optimization problem, avoiding step-by-step propagation and supporting highly parallelizable training. The method is demonstrated on five benchmark problems, achieving excellent agreement with reference solutions across all cases. These results demonstrate the method's accuracy and flexibility within the bound-state manifold across various dimensions and interaction regimes. While the current localized Ansatz inherently restricts the description of extensive ionization and continuum states, the method demonstrates the capability to stably simulate coherent multi-electron dynamics over extended time windows. Our framework offers a highly expressive alternative to traditional basis-dependent or mean-field methods, opening new possibilities for ab initio simulations of time-dependent quantum systems, with applications in quantum dynamics, molecular control, and ultrafast spectroscopy.

Quantum mechanical ground states of many-body systems can be important resources for various investigations: for quantum sensing, for benchmarking quantum hardware with classically solvable states, as the initial states for nonequilibrium quantum dynamics following quenches, the simulation of quantum processes that start by coupling systems in ground states, eg, could be a process in quantum chemistry, while their approximations are required as inputs to quantum phase estimation algorithm. However, preparing ground states can be challenging; for example, it may require adiabatic switching of Hamiltonian terms slower than an inverse gap, which can be time consuming and bring in decoherence. Here we investigate the possibility of preparing a many-body entangled ground state of a certain Hamiltonian, which can be called a quantum “problem” Hamiltonian, using the time evolution of an initial fiducial state by another time independent “solver” Hamiltonian with couplings up to unit strength for a very short fixed (unit) time: a “time efficient” ansatz. The parameters of the solver Hamiltonian are optimised classically minimising energy as the cost function. We present a study of up to $n=14$ qubit many-body states prepared using this methodology. Importantly, we find that a strategy of combining a warm start (an already prepared ground state of a $n-1$ qubit Hamiltonian) and incrementally adding extra couplings of a qubit is the best scaling strategy to prepare the ground state of a $n$-qubit Hamiltonian.

The Schmidt number is an important kind of characterization of quantum entanglement. Quantum states with higher Schmidt numbers demonstrate significant advantages in various quantum information processing tasks. By deriving a class of k-positive linear maps based on symmetric measurements, we present new Schmidt-number witnesses of class (k + 1). By detailed example, we show that our Schmidt number witnesses identify better the Schmidt number of quantum states in high-dimensional systems. Furthermore, we note that the Fedorov ratio, which coincides with the Schmidt number for pure Gaussian states and provides a close approximation in non-Gaussian cases such as spontaneous parametric down-conversion, serves as an experimentally accessible tool for validating the proposed (k +1)-class Schmidt-number witnesses.

Periodically driven many-body systems generally heat towards a featureless 'infinite-temperature' state. As an alternative to uniform heating in a clean system, here we establish a Floquet superheating regime, where fast heating nucleates at ”hot spots" generated by rare fluctuations in the local energy with respect to an appropriate effective Hamiltonian. Striking macroscopic consequences include exceptionally long-lived prethermalization and non-ergodic bimodal distributions of macroscopic observables. Superheating is predicated on a heating rate depending strongly on the local fluctuation; in our example, this is supplied by a sharp state-selective spin-echo, where the energy absorption is strongly suppressed for low-energy states, while thermal fluctuations open up excessive heating channels. A simple phenomenological theory is developed to show the existence of a critical droplet size, which incorporates heating by the driving field as well as the heat current out of the droplet. Our results shine light on a new heating mechanism and suggest new routes towards stabilizing non-equilibrium phases of matter in driven systems.

We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if $\epsilon=0$, then the graph is completely separated. We show that for sufficiently small values of $\epsilon$, a phenomenon called pulsation occurs. The pulsation is characterized by the periodic transfer of the quantum walker between the two graphs. An asymptotic expression with respect to small $\epsilon$ for the probability of finding the walker on either of the two graphs is derived. This expression reveals that the pulsation depends solely on the number of edges in each graph, regardless of their structure. In addition, we obtain that the quantum walker is transferred periodically between the two graphs, with a period of order $O(\epsilon^{-1/2})$. Furthermore, when the number of edges of two graphs is equal, the quantum walker is almost completely transferred.

Quantum state tomography (QST) is an indispensable tool for characterizing many-body quantum systems. However, due to the exponential scaling of the cost of the protocol with system size, many approaches have been developed for quantum states with specific structure, such as low-rank states. In this paper, we show how approximate message passing (AMP), an algorithmic framework for sparse signal recovery, can be used to perform low-rank QST. AMP provides asymptotically optimal performance guarantees for large sparse recovery problems, which suggests its utility for QST. We discuss the design challenges that come with applying AMP to QST, and show that by properly designing the AMP algorithm, we can reduce the reconstruction error by over an order of magnitude compared to existing approaches to low-rank QST. We also performed tomographic experiments on IBM Kingston and considered the effect of device noise on the reliability of the predicted fidelity of state preparation. Our work advances the state of low-rank QST and may be applicable to other quantum tomography protocols.

The purpose of this research is to explore whether it is possible to construct a design theory for subscription services for intangible goods from a time discounting perspective, based on quantum information theory, which is the foundational theory for quantum computers and similar technologies. To this end, we propose a mathematical model of subscription services using optimization problems based on optimal growth theory from standard economics, and with reference to microeconomics, we define utility as a value function of customer satisfaction derived from quantum mutual information, an entropy measure in quantum information theory, by considering time discounting. We propose the quantification of customer satisfaction and the formulation of consumer surplus. In the mathematical model of subscription services, the existence of a minimum value in the time-discounted customer satisfaction value function under budget constraints, and the realization of a mathematical expression for consumer surplus, could be explained by the laws of behavioral economics. This yielded new insights into the design of individually customized customer experiences, enhanced the feasibility of constructing economic models based on quantum information theory and the mathematical design of customer experiences, raised the possibility that mathematical models using quantum information theory can achieve greater economic welfare than standard economics, and increased the feasibility of implementing optimization problem algorithms on quantum computers.

We present the Lukasiewicz logic as a viable system for an implication algebra on a system of qubits. Our results show that the three valued Lukasiewicz logic can be embedded in the stabilized space of an arbitrary quantum error correcting stabilizer code. We then fully characterize the non trivial errors that may occur up to group isomorphism. Lastly, we demonstrate by explicit algorithmic example, how any algorithm consistent with the Lukasiewicz logic can immediately run on a quantum system and utilize the indeterminate state.

We introduce a general framework for realizing $\mathcal{PT}$-like phase transitions in non-Hermitian systems without imposing explicit parity–time ($\mathcal{PT}$) symmetry. The approach is based on constructing a Hamiltonian as the square root of a supersymmetric partner energy-shifted by a constant. This formulation naturally leads to bipartite dynamics with balanced gain and loss and can incorporate non-reciprocal couplings. The resulting systems exhibit entirely real spectra over a finite parameter range precisely when the corresponding passive Hamiltonian lacks a zero mode. As the non-Hermitian parameter representing gain and loss increases, the spectrum undergoes controlled real-to-complex transitions at second-order exceptional points. We demonstrate the versatility of this framework through several examples, including well-known models such as the Hatano–Nelson (HN) and complex Su–Schrieffer–Heeger (cSSH) lattices. Extending the formalism to $q$-commuting matrices further enables the systematic realization of higher-order exceptional points in systems with unidirectional couplings. Overall, this work uncovers new links between non-Hermitian physics and supersymmetry, offering a practical route to engineer photonic arrays with tunable spectral properties beyond what is achievable with explicit $\mathcal{PT}$-symmetry.