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

Springer eBooks

Quantum Ops: Bridging Quantum Computing and IT Operations

Milankumar Rana, Bishwajeet Pandey

Published Jan 1, 2026• 5 citations
Publisher
DOI
10.1007/978-3-032-10775-6

Related papers

Quantum Computing and Programming

Riccardo Bassoli, Holger Boche, Christian Deppe +4 more

Foundations in signal processing, communications and networking•Oct 30, 2020•0 citations

Quantum-inspired Computing: Entanglement-enhanced Technique for Short Portfolio in Global Markets

Yu-Chi Jiang, Yun-Ting Lai, Po-Chun Chen +5 more

Portfolio optimization is an essential aspect of the development of quantum computing. The quantum-inspired op-timization (QIO) algorithm facilitates an efficient search for the optimal solution by simulating quantum mechanics on a classical computer, thus bridging quantum theory and the actual implementation of quantum computing. This study proposes an entanglement-based QIO to optimize the short-selling portfolio in a group of seven (G7) industrialized nations, which are the world's largest markets and significantly impact global economies. To diversify investment options in response to the ever-changing markets, short-selling is a worthy topic for dis-cussion. The innovative trend ratio can precisely determine the performance of a short-selling portfolio during a stable downward trend. Implementing the short-selling trend ratio model in the significant G7 markets broadens its applicability.

IEEE International Conference on Nanotechnology (IEEE-NANO)•Jul 2, 2023•7 citations

Quantum Computing Overview

Osama Babakhel, Mujahid Tabassum, Tripti Sharma

Information systems engineering and management•Jan 1, 2025•0 citations

Computing partial traces and reduced density matrices

Jonas Maziero

Taking partial traces (PTrs) for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this paper, we present a thorough description of this function and analyze the number of elementary operations (ops) needed, under some possible alternative implementations, to compute it on a classical computer. As we note, it is worthwhile doing some analytical developments in order to avoid making null multiplications and sums, what can considerably reduce the ops. For instance, for a bipartite system [Formula: see text] with dimensions [Formula: see text] and [Formula: see text] and for [Formula: see text], while a direct use of PTr definition applied to [Formula: see text] requires [Formula: see text] ops, its optimized implementation entails [Formula: see text] ops. In the sequence, we regard the computation of PTrs for general multipartite systems and describe Fortran code provided to implement it numerically. We also consider the calculation of reduced density matrices via Bloch’s parametrization with generalized Gell Mann’s matrices.

arXiv:1601.07458•International Journal of Modern Physics C•Aug 2, 2016•28 citations

Quantum Computing - An Overview

T. R. Govindan

•Apr 16, 2018•0 citations

Non-unitary probabilistic quantum computing

Robert M. Gingrich, Colin P. Williams

We present a method for designing quantum circuits that perform non-unitary quantum computations on n-quhit states prohabilistically, and give analytic expressions for the suc-cess probability and fidelity. Our scheme works by embedding the desired non-unitaiy op-erator within an anti-block-diagonal (n+l)-qubit Hamiltonian, H, which induces a unitary operator!J = exp(iEH), with E a constant. By using $2 acting on the original state aug-mented with an ancilla prepared in the 11) state, we can obtain the desired nowunitary transformation whenever the ancilla is found to be IO). Our scheme has the advantage that a "failure " result, i.e., fmding the ancilla to be 11) rather than 10) , perturbs the remaining n-qubit state very little. As a result we can repeatedly re-evolve and measure the sequence of "failed " states until we fmd the ancilla in the 10) state, i.e., detect the "success " condi-tion. We describe an application of our scheme to probabilistic state synthesis, I.

•Jan 5, 2004•8 citations
Portfolio optimization is an essential aspect of the development of quantum computing. The quantum-inspired op-timization (QIO) algorithm facilitates an efficient search for the optimal solution by simulating quantum mechanics on a classical computer, thus bridging quantum theory and the actual implementation of quantum computing. This study proposes an entanglement-based QIO to optimize the short-selling portfolio in a group of seven (G7) industrialized nations, which are the world's largest markets and significantly impact global economies. To diversify investment options in response to the ever-changing markets, short-selling is a worthy topic for dis-cussion. The innovative trend ratio can precisely determine the performance of a short-selling portfolio during a stable downward trend. Implementing the short-selling trend ratio model in the significant G7 markets broadens its applicability.
Taking partial traces (PTrs) for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this paper, we present a thorough description of this function and analyze the number of elementary operations (ops) needed, under some possible alternative implementations, to compute it on a classical computer. As we note, it is worthwhile doing some analytical developments in order to avoid making null multiplications and sums, what can considerably reduce the ops. For instance, for a bipartite system [Formula: see text] with dimensions [Formula: see text] and [Formula: see text] and for [Formula: see text], while a direct use of PTr definition applied to [Formula: see text] requires [Formula: see text] ops, its optimized implementation entails [Formula: see text] ops. In the sequence, we regard the computation of PTrs for general multipartite systems and describe Fortran code provided to implement it numerically. We also consider the calculation of reduced density matrices via Bloch’s parametrization with generalized Gell Mann’s matrices.
We present a method for designing quantum circuits that perform non-unitary quantum computations on n-quhit states prohabilistically, and give analytic expressions for the suc-cess probability and fidelity. Our scheme works by embedding the desired non-unitaiy op-erator within an anti-block-diagonal (n+l)-qubit Hamiltonian, H, which induces a unitary operator!J = exp(iEH), with E a constant. By using $2 acting on the original state aug-mented with an ancilla prepared in the 11) state, we can obtain the desired nowunitary transformation whenever the ancilla is found to be IO). Our scheme has the advantage that a "failure " result, i.e., fmding the ancilla to be 11) rather than 10) , perturbs the remaining n-qubit state very little. As a result we can repeatedly re-evolve and measure the sequence of "failed " states until we fmd the ancilla in the 10) state, i.e., detect the "success " condi-tion. We describe an application of our scheme to probabilistic state synthesis, I.