Truncated-Binary Encoding: Spectral Degree Reduction of Combinatorial Optimization Problems for Quantum Hardware

Tristan Zaborniak

arxiv: 2605.17143 · v1 · pith:XER2LUAWnew · submitted 2026-05-16 · 🪐 quant-ph

Truncated-Binary Encoding: Spectral Degree Reduction of Combinatorial Optimization Problems for Quantum Hardware

Tristan Zaborniak This is my paper

Pith reviewed 2026-05-20 14:40 UTC · model grok-4.3

classification 🪐 quant-ph

keywords truncated-binary encodingdegree reductioncombinatorial optimizationquantum hardwareHUBOWalsh transformstruncation errorenergy landscape

0 comments

The pith

Truncated-binary encoding drops high-degree monomials from cost encodings for quantum hardware while preserving the global minimum under sufficient gap conditions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper proposes truncated-binary encoding to reduce the maximum degree of binary optimization problems derived from high-cardinality discrete cost function networks. Quantum hardware generally requires low-degree interactions, so exact encodings of high-cardinality variables create substantial overhead in circuit depth or ancilla qubits. The authors derive a tight bound on the error introduced by dropping high-order terms and identify conditions on the energy gap and local basin barriers that keep the original global minimum intact after truncation. They further show that the encoded coefficients are Walsh transforms of the cost tables and that smoothness in those tables implies fast decay of high-degree contributions, giving a way to pick the truncation cutoff in advance.

Core claim

Truncated-binary encoding modifies exact-binary encoding by omitting Ising-basis monomials above a chosen cutoff k_max. A tight L^∞ bound on the truncation error is established in terms of the omitted couplings. Sufficient conditions on the energy gap and on the single bit-flip basin barrier ensure that TBE preserves the global minimum and its local-minimum structure. A noise floor condition on the spectral profile makes the truncation residual act as a perturbative correction to the underlying landscape. The encoded coefficients are expressed directly as Walsh transforms of the CFN cost tables, and a bound is proved under which smoothness of each cost table implies rapid decay of its high-�

What carries the argument

The L^∞ bound on truncation error in terms of the omitted couplings, which quantifies the maximum perturbation to the cost landscape.

If this is right

Higher-cardinality variables can be used in quantum optimization with reduced maximum degree and therefore lower circuit depth or ancilla overhead.
The truncation cutoff k_max can be selected before encoding using only the smoothness properties of the original cost tables.
The local-minimum structure of the original problem is retained whenever the single bit-flip basin barrier exceeds the truncation error bound.
When the spectral profile meets the noise floor condition the dropped terms act only as a small correction rather than altering the landscape qualitatively.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same truncation criterion could be applied to benchmark combinatorial problems with large variable domains to measure concrete resource savings on quantum hardware.
Direct numerical comparison of TBE against ancilla-based degree-reduction methods on identical CFN instances would quantify the qubit-versus-error trade-off.
The Walsh-transform decay bound may suggest analogous smoothness-based cutoffs for other discrete-to-binary encodings used in quantum solvers.

Load-bearing premise

The energy gap and single bit-flip basin barrier of the underlying cost function network satisfy the stated inequalities relative to the truncation error bound.

What would settle it

Constructing a small discrete cost function network where the energy gap is smaller than the derived truncation error bound and checking whether the global minimum of the truncated encoding differs from the original.

read the original abstract

Exact-binary encoding compiles a discrete cost function network (CFN) into a higher-order unconstrained binary optimization (HUBO) problem whose maximum monomial degree grows with the cardinalities of the underlying CFN variables. Given that quantum optimization hardware generally favours quadratic unconstrained binary optimization or low-degree HUBO Hamiltonians, high-cardinality CFNs therefore incur substantial overhead in the form of circuit depth, or ancilla qubits when degree-reduction techniques are employed. To ameliorate these issues, we propose \textit{truncated-binary encoding} (TBE): a modification of exact-binary encoding in which Ising-basis monomials exceeding a chosen cutoff $k_\text{max}$ are dropped from the encoded cost. We establish a tight $L^\infty$ bound on the truncation error in terms of the omitted couplings, derive sufficient conditions on the energy gap and on the single bit-flip basin barrier under which TBE preserves the global minimum and its local-minimum structure, and characterize a noise floor condition on the spectral profile under which the truncation residual acts as a perturbative correction to the underlying landscape. We then express the encoded coefficients directly as Walsh transforms of the underlying CFN cost tables, and prove a bound under which smoothness of each cost table implies rapid decay of its high-degree Walsh mass. Together these results yield a principled \textit{a priori} criterion for selecting $k_\text{max}$ and for judging whether a given CFN admits a small-$k_\text{max}$ TBE.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Truncated-binary encoding gives a concrete way to drop high-degree terms from exact-binary encodings while bounding the error and protecting the minimum under gap conditions.

read the letter

This paper gives a way to truncate the high-degree terms in exact-binary encodings of combinatorial problems so you can run them on quantum hardware with less overhead, while still guaranteeing the minimum stays the same under certain conditions. The new part is the L^∞ bound on the error from dropping those terms, expressed directly from the omitted couplings. They also turn the encoded coefficients into Walsh transforms of the original cost tables and show that if the cost tables are smooth, the high-degree Walsh coefficients decay fast enough to pick a small k_max without much loss. That smoothness-based cutoff is the practical hook. They derive conditions on the energy gap and the single bit-flip basin barrier that ensure the global minimum and the local-min structure are preserved. There's also a noise-floor condition where the truncation acts like a small perturbation. The derivations look careful on paper, but the real test is how often those gap and barrier conditions hold for problems people actually care about. If they require the original problem to have a large gap relative to the truncation error, the method might only apply to a narrow set of instances. The abstract doesn't show numerical checks, so it's not clear yet how tight the bounds are in examples. This work is for quantum optimization researchers who encode discrete variables with more than two states and need to keep the Hamiltonian degree low. It should interest people in logistics and scheduling who hit the degree wall on current hardware. I think it deserves a serious referee. The claims are specific and the approach is systematic, so a review would help pin down whether the preservation conditions are usable in practice.

Referee Report

0 major / 3 minor

Summary. The paper proposes truncated-binary encoding (TBE) as a degree-reduction technique for HUBO problems obtained from exact-binary encoding of high-cardinality cost function networks (CFNs). It derives a tight L^∞ bound on the truncation error expressed in terms of omitted couplings, sufficient conditions on the energy gap and single bit-flip basin barrier that guarantee preservation of the global minimum and local-minimum structure, a noise-floor condition under which the residual acts perturbatively, and Walsh-transform expressions for the encoded coefficients together with a decay bound showing that smoothness of the cost tables implies rapid decay of high-degree Walsh mass; these results are combined into an a priori criterion for choosing the cutoff k_max.

Significance. If the central derivations hold, the work supplies a principled, non-heuristic route to lowering the degree of quantum optimization Hamiltonians while controlling approximation error. The explicit L^∞ error bound, preservation conditions, and spectral decay result under a smoothness hypothesis constitute a clear advance over ad-hoc truncation, and the a priori selection criterion for k_max directly addresses practical overhead in circuit depth and ancilla count for quantum hardware.

minor comments (3)

[Abstract] Abstract: the statement that the L^∞ bound is 'tight' would be strengthened by an explicit remark (or forward reference) indicating whether equality is attained for some finite configuration of omitted couplings.
The manuscript would benefit from a short, fully worked numerical example (e.g., a small CFN with cardinality-4 variables) that computes the truncation error, verifies the preservation conditions, and illustrates the a priori k_max choice.
Notation: the precise mapping from CFN cost tables to Walsh coefficients (mentioned in the abstract) should be written out once in the main text with the standard Walsh-transform definition recalled for readers outside the spectral-analysis community.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive and constructive report, including the accurate summary of our contributions and the recommendation for minor revision. We are encouraged by the recognition that the L^∞ bound, preservation conditions, spectral decay result, and a priori k_max criterion represent a principled advance over ad-hoc truncation.

Circularity Check

0 steps flagged

No significant circularity; derivations are self-contained

full rationale

The paper derives a tight L^∞ truncation-error bound explicitly in terms of omitted couplings, sufficient conditions for global-minimum preservation that reference the original CFN energy gap and bit-flip barrier relative to that bound, and a Walsh-transform decay result under an independent smoothness hypothesis on the cost tables. These steps are presented as direct mathematical derivations yielding an a priori k_max selection criterion. No load-bearing step reduces by construction to a fitted parameter, self-citation, or redefinition of its own inputs; the central claims remain independent of the target results.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard mathematical tools (L^∞ norms, Walsh transforms) and domain assumptions from combinatorial optimization (energy gaps, basin barriers) rather than new invented entities or fitted constants.

axioms (2)

domain assumption The underlying CFN admits a well-defined energy gap and single bit-flip basin barrier that can be compared to the truncation error.
Invoked when stating sufficient conditions for preserving the global minimum (abstract).
standard math Walsh transforms exist and can be used to express the encoded coefficients for any finite CFN cost table.
Used to characterize the spectral profile and smoothness implication (abstract).

pith-pipeline@v0.9.0 · 5792 in / 1376 out tokens · 45514 ms · 2026-05-20T14:40:46.645501+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages · 2 internal anchors

[1]

Quantum an- nealing with manufactured spins

M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk et al., “Quantum annealing with manufactured spins,”Nature, vol. 473, no. 7346, pp. 194–198, 2011. [Online]. Available: https://doi.org/10.1038/nature10012

work page doi:10.1038/nature10012 2011
[2]

Adiabatic quantum computation,

T. Albash and D. A. Lidar, “Adiabatic quantum computation,”Reviews of Modern Physics, vol. 90, no. 1, p. 015002, 2018. [Online]. Available: https://doi.org/10.1103/RevModPhys.90.015002

work page doi:10.1103/revmodphys.90.015002 2018
[3]

A Quantum Approximate Optimization Algorithm

E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” 2014. [Online]. Available: https://doi.org/10. 48550/arXiv.1411.4028

work page internal anchor Pith review Pith/arXiv arXiv 2014
[4]

Rieffel, Davide Venturelli, and Rupak Biswas

S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,”Algorithms, vol. 12, no. 2, p. 34, 2019. [Online]. Available: https://doi.org/10.3390/a12020034

work page doi:10.3390/a12020034 2019
[5]

Pseudo-Boolean optimization,

E. Boros and P. L. Hammer, “Pseudo-Boolean optimization,”Discrete Applied Mathematics, vol. 123, no. 1–3, pp. 155–225, 2002. [Online]. Available: https://doi.org/10.1016/S0166-218X(01)00341-9

work page doi:10.1016/s0166-218x(01)00341-9 2002
[6]

Dickerson

N. Dattani, “Quadratization in discrete optimization and quantum mechanics,” 2019. [Online]. Available: https://doi.org/10.48550/arXiv. 1901.04405

work page internal anchor Pith review doi:10.48550/arxiv 2019
[7]

Quadratic reformulations of nonlinear binary optimization problems,

M. Anthony, E. Boros, Y . Crama, and A. Gruber, “Quadratic reformulations of nonlinear binary optimization problems,” Mathematical Programming, vol. 162, no. 1–2, pp. 115–144, 2017. [Online]. Available: https://doi.org/10.1007/s10107-016-1032-4 11

work page doi:10.1007/s10107-016-1032-4 2017
[8]

Valued constraint satisfaction problems: Hard and easy problems,

T. Schiex, H. Fargier, and G. Verfaillie, “Valued constraint satisfaction problems: Hard and easy problems,” inProc. 14th Int. Joint Conf. Artificial Intelligence (IJCAI), 1995, pp. 631–637. [Online]. Available: https://www.ijcai.org/Proceedings/95-1/Papers/083.pdf

work page 1995
[9]

Soft arc consistency revisited,

M. C. Cooper, S. de Givry, M. S ´anchez, T. Schiex, M. Zytnicki, and T. Werner, “Soft arc consistency revisited,”Artificial Intelligence, vol. 174, no. 7–8, pp. 449–478, 2010. [Online]. Available: https: //doi.org/10.1016/j.artint.2010.02.001

work page doi:10.1016/j.artint.2010.02.001 2010
[10]

Lucas, Frontiers in Physics2 (2014), 10.3389/fphy.2014.00005, arXiv:1302.5843

A. Lucas, “Ising formulations of many NP problems,”Frontiers in Physics, vol. 2, p. 5, 2014. [Online]. Available: https://doi.org/10.3389/ fphy.2014.00005

work page arXiv 2014
[11]

Domain wall encoding of discrete variables for quantum annealing and QAOA,

N. Chancellor, “Domain wall encoding of discrete variables for quantum annealing and QAOA,”Quantum Science and Technology, vol. 4, no. 4, p. 045004, 2019. [Online]. Available: https://doi.org/10. 1088/2058-9565/ab33c2

work page 2019
[12]

Understanding domain-wall encoding the- oretically and experimentally

J. Berwald, N. Chancellor, and R. Dridi, “Understanding domain-wall encoding theoretically and experimentally,”Philosophical Transactions of the Royal Society A, vol. 381, no. 2241, p. 20210410, 2023. [Online]. Available: https://doi.org/10.1098/rsta.2021.0410

work page doi:10.1098/rsta.2021.0410 2023
[13]

Toward quantum computational biomolecular structure prediction,

T. Zaborniak, “Toward quantum computational biomolecular structure prediction,” Ph.D. dissertation, University of Victoria, 2025. [Online]. Available: https://hdl.handle.net/1828/22736

work page 2025
[14]

Lechner, P

W. Lechner, P. Hauke, and P. Zoller, “A quantum annealing architecture with all-to-all connectivity from local interactions,”Science Advances, vol. 1, no. 9, p. e1500838, 2015. [Online]. Available: https://doi.org/10.1126/sciadv.1500838

work page doi:10.1126/sciadv.1500838 2015
[15]

Cambridge University Press, doi:10.1017/CBO9781139814782

R. O’Donnell,Analysis of Boolean Functions. Cambridge, UK: Cambridge University Press, 2014. [Online]. Available: https://doi.org/ 10.1017/CBO9781139814782

work page doi:10.1017/cbo9781139814782 2014
[16]

A brief introduction to Fourier analysis on the Boolean cube,

R. de Wolf, “A brief introduction to Fourier analysis on the Boolean cube,”Theory of Computing, Graduate Surveys, no. 1, pp. 1–20, 2008. [Online]. Available: https://doi.org/10.4086/toc.gs.2008.001

work page doi:10.4086/toc.gs.2008.001 2008
[17]

Masset, R

D. Allouche, I. Andr ´e, S. Barbe, J. Davies, S. de Givry, G. Katsirelos, B. O’Sullivan, S. Prestwich, T. Schiex, and S. Traor ´e, “Computational protein design as an optimization problem,”Artificial Intelligence, vol. 212, pp. 59–79, 2014. [Online]. Available: https://doi.org/10.1016/j. artint.2014.03.005

work page doi:10.1016/j 2014
[18]

Construction of energy functions for lattice heteropolymer models: Efficient encodings and embedding strategies for quantum annealing,

R. Babbush, A. Perdomo-Ortiz, B. O’Gorman, W. Macready, and A. Aspuru-Guzik, “Construction of energy functions for lattice heteropolymer models: Efficient encodings and embedding strategies for quantum annealing,” inAdvances in Chemical Physics, Vol. 155. Wiley, 2014, pp. 201–244. [Online]. Available: https://doi.org/10.1002/ 9781118755815.ch05

work page 2014
[19]

P. L. Hammer and S. Rudeanu,Boolean Methods in Operations Research and Related Areas. Berlin, Heidelberg: Springer, 1968. [Online]. Available: https://doi.org/10.1007/978-3-642-85823-9

work page doi:10.1007/978-3-642-85823-9 1968
[20]

Correlated and uncorrelated fitness landscapes and how to tell the difference,

E. D. Weinberger, “Correlated and uncorrelated fitness landscapes and how to tell the difference,”Biological Cybernetics, vol. 63, no. 5, pp. 325–336, 1990. [Online]. Available: https://doi.org/10.1007/ BF00202749

work page 1990
[21]

Talagrand,Mean Field Models for Spin Glasses, Volume I: Basic Examples, ser

M. Talagrand,Mean Field Models for Spin Glasses, Volume I: Basic Examples, ser. Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer, 2011. [Online]. Available: https://doi.org/10. 1007/978-3-642-15202-3

work page 2011
[22]

Billingsley,Probability and Measure, 3rd ed

P. Billingsley,Probability and Measure, 3rd ed. New York: Wiley,

work page
[23]

Available: https://www.wiley.com/en-us/Probability+ and+Measure%2C+3rd+Edition-p-9780471007104

[Online]. Available: https://www.wiley.com/en-us/Probability+ and+Measure%2C+3rd+Edition-p-9780471007104

work page
[24]

Durrett,Probability: Theory and Examples, 5th ed

R. Durrett,Probability: Theory and Examples, 5th ed. Cambridge University Press, 2019. [Online]. Available: https://doi.org/10.1017/ 9781108591034

work page 2019
[25]

The influence of variables on Boolean functions,

J. Kahn, G. Kalai, and N. Linial, “The influence of variables on Boolean functions,” inProc. 29th Annual Symp. on Foundations of Computer Science (FOCS), 1988, pp. 68–80. [Online]. Available: https://doi.org/10.1109/SFCS.1988.21923 12

work page doi:10.1109/sfcs.1988.21923 1988

[1] [1]

Quantum an- nealing with manufactured spins

M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk et al., “Quantum annealing with manufactured spins,”Nature, vol. 473, no. 7346, pp. 194–198, 2011. [Online]. Available: https://doi.org/10.1038/nature10012

work page doi:10.1038/nature10012 2011

[2] [2]

Adiabatic quantum computation,

T. Albash and D. A. Lidar, “Adiabatic quantum computation,”Reviews of Modern Physics, vol. 90, no. 1, p. 015002, 2018. [Online]. Available: https://doi.org/10.1103/RevModPhys.90.015002

work page doi:10.1103/revmodphys.90.015002 2018

[3] [3]

A Quantum Approximate Optimization Algorithm

E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” 2014. [Online]. Available: https://doi.org/10. 48550/arXiv.1411.4028

work page internal anchor Pith review Pith/arXiv arXiv 2014

[4] [4]

Rieffel, Davide Venturelli, and Rupak Biswas

S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,”Algorithms, vol. 12, no. 2, p. 34, 2019. [Online]. Available: https://doi.org/10.3390/a12020034

work page doi:10.3390/a12020034 2019

[5] [5]

Pseudo-Boolean optimization,

E. Boros and P. L. Hammer, “Pseudo-Boolean optimization,”Discrete Applied Mathematics, vol. 123, no. 1–3, pp. 155–225, 2002. [Online]. Available: https://doi.org/10.1016/S0166-218X(01)00341-9

work page doi:10.1016/s0166-218x(01)00341-9 2002

[6] [6]

Dickerson

N. Dattani, “Quadratization in discrete optimization and quantum mechanics,” 2019. [Online]. Available: https://doi.org/10.48550/arXiv. 1901.04405

work page internal anchor Pith review doi:10.48550/arxiv 2019

[7] [7]

Quadratic reformulations of nonlinear binary optimization problems,

M. Anthony, E. Boros, Y . Crama, and A. Gruber, “Quadratic reformulations of nonlinear binary optimization problems,” Mathematical Programming, vol. 162, no. 1–2, pp. 115–144, 2017. [Online]. Available: https://doi.org/10.1007/s10107-016-1032-4 11

work page doi:10.1007/s10107-016-1032-4 2017

[8] [8]

Valued constraint satisfaction problems: Hard and easy problems,

T. Schiex, H. Fargier, and G. Verfaillie, “Valued constraint satisfaction problems: Hard and easy problems,” inProc. 14th Int. Joint Conf. Artificial Intelligence (IJCAI), 1995, pp. 631–637. [Online]. Available: https://www.ijcai.org/Proceedings/95-1/Papers/083.pdf

work page 1995

[9] [9]

Soft arc consistency revisited,

M. C. Cooper, S. de Givry, M. S ´anchez, T. Schiex, M. Zytnicki, and T. Werner, “Soft arc consistency revisited,”Artificial Intelligence, vol. 174, no. 7–8, pp. 449–478, 2010. [Online]. Available: https: //doi.org/10.1016/j.artint.2010.02.001

work page doi:10.1016/j.artint.2010.02.001 2010

[10] [10]

Lucas, Frontiers in Physics2 (2014), 10.3389/fphy.2014.00005, arXiv:1302.5843

A. Lucas, “Ising formulations of many NP problems,”Frontiers in Physics, vol. 2, p. 5, 2014. [Online]. Available: https://doi.org/10.3389/ fphy.2014.00005

work page arXiv 2014

[11] [11]

Domain wall encoding of discrete variables for quantum annealing and QAOA,

N. Chancellor, “Domain wall encoding of discrete variables for quantum annealing and QAOA,”Quantum Science and Technology, vol. 4, no. 4, p. 045004, 2019. [Online]. Available: https://doi.org/10. 1088/2058-9565/ab33c2

work page 2019

[12] [12]

Understanding domain-wall encoding the- oretically and experimentally

J. Berwald, N. Chancellor, and R. Dridi, “Understanding domain-wall encoding theoretically and experimentally,”Philosophical Transactions of the Royal Society A, vol. 381, no. 2241, p. 20210410, 2023. [Online]. Available: https://doi.org/10.1098/rsta.2021.0410

work page doi:10.1098/rsta.2021.0410 2023

[13] [13]

Toward quantum computational biomolecular structure prediction,

T. Zaborniak, “Toward quantum computational biomolecular structure prediction,” Ph.D. dissertation, University of Victoria, 2025. [Online]. Available: https://hdl.handle.net/1828/22736

work page 2025

[14] [14]

Lechner, P

W. Lechner, P. Hauke, and P. Zoller, “A quantum annealing architecture with all-to-all connectivity from local interactions,”Science Advances, vol. 1, no. 9, p. e1500838, 2015. [Online]. Available: https://doi.org/10.1126/sciadv.1500838

work page doi:10.1126/sciadv.1500838 2015

[15] [15]

Cambridge University Press, doi:10.1017/CBO9781139814782

R. O’Donnell,Analysis of Boolean Functions. Cambridge, UK: Cambridge University Press, 2014. [Online]. Available: https://doi.org/ 10.1017/CBO9781139814782

work page doi:10.1017/cbo9781139814782 2014

[16] [16]

A brief introduction to Fourier analysis on the Boolean cube,

R. de Wolf, “A brief introduction to Fourier analysis on the Boolean cube,”Theory of Computing, Graduate Surveys, no. 1, pp. 1–20, 2008. [Online]. Available: https://doi.org/10.4086/toc.gs.2008.001

work page doi:10.4086/toc.gs.2008.001 2008

[17] [17]

Masset, R

D. Allouche, I. Andr ´e, S. Barbe, J. Davies, S. de Givry, G. Katsirelos, B. O’Sullivan, S. Prestwich, T. Schiex, and S. Traor ´e, “Computational protein design as an optimization problem,”Artificial Intelligence, vol. 212, pp. 59–79, 2014. [Online]. Available: https://doi.org/10.1016/j. artint.2014.03.005

work page doi:10.1016/j 2014

[18] [18]

Construction of energy functions for lattice heteropolymer models: Efficient encodings and embedding strategies for quantum annealing,

R. Babbush, A. Perdomo-Ortiz, B. O’Gorman, W. Macready, and A. Aspuru-Guzik, “Construction of energy functions for lattice heteropolymer models: Efficient encodings and embedding strategies for quantum annealing,” inAdvances in Chemical Physics, Vol. 155. Wiley, 2014, pp. 201–244. [Online]. Available: https://doi.org/10.1002/ 9781118755815.ch05

work page 2014

[19] [19]

P. L. Hammer and S. Rudeanu,Boolean Methods in Operations Research and Related Areas. Berlin, Heidelberg: Springer, 1968. [Online]. Available: https://doi.org/10.1007/978-3-642-85823-9

work page doi:10.1007/978-3-642-85823-9 1968

[20] [20]

Correlated and uncorrelated fitness landscapes and how to tell the difference,

E. D. Weinberger, “Correlated and uncorrelated fitness landscapes and how to tell the difference,”Biological Cybernetics, vol. 63, no. 5, pp. 325–336, 1990. [Online]. Available: https://doi.org/10.1007/ BF00202749

work page 1990

[21] [21]

Talagrand,Mean Field Models for Spin Glasses, Volume I: Basic Examples, ser

M. Talagrand,Mean Field Models for Spin Glasses, Volume I: Basic Examples, ser. Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer, 2011. [Online]. Available: https://doi.org/10. 1007/978-3-642-15202-3

work page 2011

[22] [22]

Billingsley,Probability and Measure, 3rd ed

P. Billingsley,Probability and Measure, 3rd ed. New York: Wiley,

work page

[23] [23]

Available: https://www.wiley.com/en-us/Probability+ and+Measure%2C+3rd+Edition-p-9780471007104

[Online]. Available: https://www.wiley.com/en-us/Probability+ and+Measure%2C+3rd+Edition-p-9780471007104

work page

[24] [24]

Durrett,Probability: Theory and Examples, 5th ed

R. Durrett,Probability: Theory and Examples, 5th ed. Cambridge University Press, 2019. [Online]. Available: https://doi.org/10.1017/ 9781108591034

work page 2019

[25] [25]

The influence of variables on Boolean functions,

J. Kahn, G. Kalai, and N. Linial, “The influence of variables on Boolean functions,” inProc. 29th Annual Symp. on Foundations of Computer Science (FOCS), 1988, pp. 68–80. [Online]. Available: https://doi.org/10.1109/SFCS.1988.21923 12

work page doi:10.1109/sfcs.1988.21923 1988