Infix to postfix conversion is a process used in computer science to transform arithmetic expressions written in infix notation (where operators are placed between operands) into postfix notation (where operators follow their operands), which is more suitable for stack-based evaluation. This conversion facilitates easier computation by eliminating the need for parentheses and operator precedence rules, allowing for straightforward evaluation using a stack data structure.