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

Circuits Systems and Signal Processing

Design of Optimized Reversible Squaring and Sum-of-Squares Units

A. N. Nagamani, Chirag Ramesh, Vinod Kumar Agrawal

Published Aug 17, 2017• 7 citations
Publisher
DOI
10.1007/s00034-017-0631-5

Related papers

Optimization Approaches for Designing Quantum Reversible Arithmetic Logic Unit

Majid Haghparast, Ali Bolhassani

International Journal of Theoretical Physics•Sep 3, 2015•10 citations

An Argmax Principle for Sum-of-Squares Relaxations on the Sphere

Fernando Jeronimo Granha, Pei Wu, Haochen Xu

We develop an argmax principle for analyzing sum-of-squares relaxations of optimization problems over the unit sphere. Given a feasible pseudo-expectation, we form a polynomial of high-order pseudo-moments, such as $Φ_k(u)=\widetilde{\mathbb E}\langle x,u\rangle^{2k}$. Our guiding principle is that its maximizers are rounding candidates: their local and global optimality conditions reveal the reweighed pseudo-expectation inequalities governing SoS convergence. This viewpoint unifies several problems previously analyzed by rather different techniques. We obtain three results. First, for Best Separable State, we give a degree-$O(\sqrt{n/ε})$ SoS analysis for approximating $h_{\mathrm{sep}}(P)$ in the perfect-completeness regime, improving and simplifying Barak, Kothari and Steurer (STOC'17). The dependence is essentially tight for inverse-linear gap under the Exponential-Time Hypothesis, matching hardness from $\mathrm{QMA}(2)$ protocols. Second, for the matrix $2\to4$ norm, degree-$O(\sqrt n/ε)$ SoS gives a multiplicative $(1+ε)$ approximation. Barak et al. (STOC'12) previously gave a comparable-time constant-gap decision algorithm; our result gives a multiplicative guarantee and extends to a family of $p\to q$ norms with even $q$. Finally, for degree-$d$ polynomial optimization, we recover the convergence theorem of Bhattiprolu et al. (FOCS'17) with a shorter, more direct proof: degree-$k$ SoS gives approximation ratio $O_d((n/k)^{d/2-1})$. The paper introduces no new relaxation. Instead, the high-moment argmax gives a common way to read an SoS solution, unifying previously separate convergence analyses and yielding sharper bounds or simpler proofs.

cs.CCCross-listedarXiv:2608.02594•Aug 4, 2026•4 citations

Efficient Circuit Design of Reversible Square

H. V. Jayashree, Himanshu Thapliyal, Vinod Kumar Agrawal

Lecture notes in computer science•Jan 1, 2017•2 citations

Design of Dedicated Reversible Quantum Circuitry for Square Computation

H. V. Jayashree, Himanshu Thapliyal, Vinod Kumar Agrawal

Quantum computation is modeled by quantum circuits. All the quantum operations are reversible so the quantum circuits can be built using reversible logic gates. Reversible computing is the emerging technology, its major role is in the field of quantum computing, optical computing, and design of low power nanocircuits. The most frequently used computational unit for digital signal processing and multimedia applications is multiplier. To compute square of an operand, regular multipliers are used in general. This paper proposes a dedicated quantum circuit for computing square of an operand efficiently compared to the existing multipliers in the literature. The squaring unit is mathematically modeled and its metrics quantum cost, garbage outputs and ancilla input, gate count are calculated. We compared the proposed design with the existing multipliers to compute square and found that proposed square unit is efficient in terms of quantum cost, garbage outputs, ancilla inputs and gate count. The proposed reversible square circuit has 63% to 85% improvement of quantum cost, garbage outputs, ancilla inputs and gate count over existing reversible multiplier circuits.

International Conference on VLSI Design•Jan 1, 2014•13 citations

Optimized reversible arithmetic logic units

Payman Moallem, Maryam Ehsanpour, Ali Bolhassani +1 more

Journal of Electronics (China)•Oct 1, 2014•15 citations

Sum-of-Squares Bounds for Quantum Optimal Control

Flemming Holtorf, Frank Schäfer, Julian Arnold +2 more

The precise control of devices on the quantum scale is crucial for all quantum computing applications. The limitations of quantum control are therefore of great interest to those developing quantum hardware or researching quantum information protocols. We show how moment-sum-of-squares techniques can be combined with quantum dynamics and filtering theory to construct a hierarchy of convex optimization problems that furnish hard, computable bounds on the best achievable performance in quantum control tasks. These bounds can serve as witnesses of fundamental limitations, certificates of optimality, or performance targets and thus complement existing controller design strategies. In particular, our work allows us to compute bounds for common quantum control tasks, such as maximizing the fidelity of the final quantum state relative to a target state given a finite time budget or finding the minimum time required to reach the target state with near-unit fidelity. Our work also naturally applies to feedback-controlled quantum systems subjected to continuous observations, e.g., homodyne detection or photon counting, which are of emerging interest for the next generation of quantum devices. We provide an open-source package, MarkovBounds.jl, that is built upon the optimization ecosystem in the Julia programming language and exposes a high-level interface to the proposed bounding framework.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•0 citations
We develop an argmax principle for analyzing sum-of-squares relaxations of optimization problems over the unit sphere. Given a feasible pseudo-expectation, we form a polynomial of high-order pseudo-moments, such as Φk(u)=E~⟨x,u⟩2kΦ_k(u)=\widetilde{\mathbb E}\langle x,u\rangle^{2k}Φk​(u)=E⟨x,u⟩2k. Our guiding principle is that its maximizers are rounding candidates: their local and global optimality conditions reveal the reweighed pseudo-expectation inequalities governing SoS convergence. This viewpoint unifies several problems previously analyzed by rather different techniques. We obtain three results. First, for Best Separable State, we give a degree-O(n/ε)O(\sqrt{n/ε})O(n/ε​) SoS analysis for approximating hsep(P)h_{\mathrm{sep}}(P)hsep​(P) in the perfect-completeness regime, improving and simplifying Barak, Kothari and Steurer (STOC'17). The dependence is essentially tight for inverse-linear gap under the Exponential-Time Hypothesis, matching hardness from QMA(2)\mathrm{QMA}(2)QMA(2) protocols. Second, for the matrix 2→42\to42→4 norm, degree-O(n/ε)O(\sqrt n/ε)O(n​/ε) SoS gives a multiplicative (1+ε)(1+ε)(1+ε) approximation. Barak et al. (STOC'12) previously gave a comparable-time constant-gap decision algorithm; our result gives a multiplicative guarantee and extends to a family of p→qp\to qp→q norms with even qqq. Finally, for degree-ddd polynomial optimization, we recover the convergence theorem of Bhattiprolu et al. (FOCS'17) with a shorter, more direct proof: degree-kkk SoS gives approximation ratio Od((n/k)d/2−1)O_d((n/k)^{d/2-1})Od​((n/k)d/2−1). The paper introduces no new relaxation. Instead, the high-moment argmax gives a common way to read an SoS solution, unifying previously separate convergence analyses and yielding sharper bounds or simpler proofs.
Quantum computation is modeled by quantum circuits. All the quantum operations are reversible so the quantum circuits can be built using reversible logic gates. Reversible computing is the emerging technology, its major role is in the field of quantum computing, optical computing, and design of low power nanocircuits. The most frequently used computational unit for digital signal processing and multimedia applications is multiplier. To compute square of an operand, regular multipliers are used in general. This paper proposes a dedicated quantum circuit for computing square of an operand efficiently compared to the existing multipliers in the literature. The squaring unit is mathematically modeled and its metrics quantum cost, garbage outputs and ancilla input, gate count are calculated. We compared the proposed design with the existing multipliers to compute square and found that proposed square unit is efficient in terms of quantum cost, garbage outputs, ancilla inputs and gate count. The proposed reversible square circuit has 63% to 85% improvement of quantum cost, garbage outputs, ancilla inputs and gate count over existing reversible multiplier circuits.
The precise control of devices on the quantum scale is crucial for all quantum computing applications. The limitations of quantum control are therefore of great interest to those developing quantum hardware or researching quantum information protocols. We show how moment-sum-of-squares techniques can be combined with quantum dynamics and filtering theory to construct a hierarchy of convex optimization problems that furnish hard, computable bounds on the best achievable performance in quantum control tasks. These bounds can serve as witnesses of fundamental limitations, certificates of optimality, or performance targets and thus complement existing controller design strategies. In particular, our work allows us to compute bounds for common quantum control tasks, such as maximizing the fidelity of the final quantum state relative to a target state given a finite time budget or finding the minimum time required to reach the target state with near-unit fidelity. Our work also naturally applies to feedback-controlled quantum systems subjected to continuous observations, e.g., homodyne detection or photon counting, which are of emerging interest for the next generation of quantum devices. We provide an open-source package, MarkovBounds.jl, that is built upon the optimization ecosystem in the Julia programming language and exposes a high-level interface to the proposed bounding framework.